#include <bits/stdc++.h>

using namespace std;
#define  ll long long
ll fpower(ll a,ll b, ll M){
    ll res=1;
    while(b){
        if(b&1)
        {
            res*=a;
            res%=M;
        }
        b>>=1;
        a*=a;
        a%=M;
    }
    return res;
}
ll l[100000][26];
int main() {
    string s;
    cin >> s;
    ll M= 1000000007;
    ll n= s.size();
    ll i,j;
    for(i=0;i<n;i++){
        for(j=0;j<26;j++)
            l[i][j]=0;
    }
    l[0][s[0]-'a']++;
    for(i=1;i<n;i++){
        for(j=0;j<26;j++)
            l[i][j]=l[i-1][j];
        l[i][s[i]-'a']++;
    }
    ll fact[100001];
    fact[0]=1;
    for(i=1;i<100001;i++){
        fact[i]= fact[i-1]*i;
        fact[i]%=M;
    }
    ll q;
    cin >> q;
    for(int a0 = 0; a0 < q; a0++){
        ll L;
        ll r;
        cin >> L >> r;
        L-=1;
        r-=1;
        ll temp[26];
        for(i=0;i<26;i++){
            temp[i]= l[r][i];
        }
        if(L){
            for(i=0;i<26;i++){
                temp[i]-= l[L-1][i];
            }
        }
        ll cte=0,cto=0;
        for(i=0;i<26;i++){
            if(temp[i]%2){
                cto++;
                cte+=(temp[i]/2);
            }
            else
                cte+=(temp[i]/2);
        }
        ll ans = fact[cte];
        for(i=0;i<26;i++){
            ans =  ans * fpower(fact[temp[i]/2],M-2,M);
            ans%=M;
        }
        //cout<<ans<<endl;
        if(cto){
            ans*=cto;
            ans%=M;
        }
        cout<<ans<<endl;
    }
    return 0;
}