#include <bits/stdc++.h>

using namespace std;
#define mod 1000000007
int has[100005][27]={0};
long long fact[1000005]={0};
void initialize(string s) {
    // This function is called once before all queries.
    fact[0]=1;
    for(int i=1;i<=100000;i++)
    {
        fact[i]=(fact[i-1]*i)%mod;
    }
    for(int i=0;i<s.length();i++)
    {
         has[i][s[i]-'a']++;
        if(i!=0)
        {
            for(int j=0;j<26;j++)
            {
                has[i][j]+=has[i-1][j];
            }
        }
    }
}
long long inversemod(long long x,long long y)
{
    if(y==0)
           return 1;
    long long temp=inversemod(x,y/2)%mod;
    temp=(temp*temp)%mod;
    if(y%2!=0)
        temp=(temp*x)%mod;
    return temp;
}
long long answerQuery(int l, int r,string s) {
    // Return the answer for this query modulo 1000000007.
    long long odds=0;
    long long evens=0;
    long long reppro=1;
    for(int j=0;j<26;j++)
    {
        long long val = has[r][j]-has[l][j];
        if(s[l]==(char)('a'+j))
            val++;
        if(val==1)
            odds++;
        else
        {
            if(val>=2)
            {
                if(val%2!=0)
                    odds++;
                evens+=val/2;
                reppro=(fact[val/2]*reppro)%mod;
            }
        }
    }
    long long ans=fact[evens];
    if(odds!=0)
        ans=(ans*odds)%mod;
   // printf("ans: %lld rep: %lld\n",ans,reppro);
    return (inversemod(reppro,mod-2)*ans)%mod;
}

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;
        long long result = answerQuery(l-1, r-1,s);
        cout << result << endl;
    }
    return 0;
}