#include <bits/stdc++.h>

using namespace std;
#define ll long long int
#define M 1000000007

vector<vector<int> > pre;
vector<ll> fac(1000009,0);

void initialize(string s) {
    vector<int> tmp(30,0);
    pre.push_back(tmp);
    for(int i=0;i<s.length();i++)
    {
        tmp[s[i]-'a']++;
        pre.push_back(tmp);
    }
    fac[0] = fac[1] = 1;
    for(int i=2;i<=1000009;i++)
    {
        fac[i]  = (i*fac[i-1])%M;
    }
}
ll modexpo(ll base,ll expo)
{
    ll result = 1;
    while(expo>0)
    {
        if(expo&1)result = (result*base)%M;
        base = (base*base)%M;
        expo = expo>>1;
    }
    return result;
}
ll fact(ll n)
{
    ll result = 1;
    for(ll i=1;i<=n;i++)result = (result*i)%M;
    return result;
}
int answerQuery(int l, int r,string s) {
    vector<int> ct(30,0);
    //for(int i=l-1;i<r;i++)ct[s[i]-'a']++;
    for(int i=0;i<30;i++)
    {
        ct[i] = pre[r][i]-pre[l-1][i];
    }
    ll sum = 0,ct1 = 0;
    bool isPossible = false;
    vector<ll> tmp;
    tmp.clear();
    for(int i=0;i<30;i++)
    {
        if(ct[i]==1)ct1++;
        else if(ct[i]>1)
        {
            isPossible = true;
            if(ct[i]%2==1)ct1++;
            tmp.push_back(ct[i]/2);
            sum+=(ct[i]/2);
        }
    }
    //cout << "sum = " << sum << endl;
    ll num = fac[sum],denom = 1;
    for(int i=0;i<tmp.size();i++)
    {
        //cout << "temp = " << tmp[i] << " ";
        denom = (denom*fac[tmp[i]])%M;
    }
    //cout << "num = " << num << " denom = " << denom << endl;
    //cout << endl;
    ll ans = modexpo(denom,M-2);
    ans = (ans*num)%M;
    if(ct1>0)ans = (ans*ct1)%M;
    return ans;
}

int main() {
    string s;
    cin >> s;
    initialize(s);
    int q;
    cin >> q;
    for(int a0 = 0; a0 < q; a0++){
        int l;
        int r;
        cin >> l >> r;
        int result = answerQuery(l, r,s);
        cout << result << endl;
    }
    return 0;
}