#include <bits/stdc++.h>
#define LL long long
#define M 1000000007
#define PB push_back
using namespace std;
int inv(int a,int m)
{
    int m0 = m, t, q;
    int x0 = 0, x1 = 1;
 
    if (m == 1)
       return 0;
    while (a > 1)
    {
        q = a / m;
        t = m;
        m = a % m, a = t;
        t = x0;
        x0 = x1 - q * x0;
        x1 = t;
    }
    if (x1 < 0)
       x1 += m0;
    return x1;
}
int main() {
    string s;
    cin >> s;
    LL an[30],fact[100010],l,r,i,n,ans,lol,k,factinv[100010];
    vector<LL> ct[30];
    //initialize(s);
    int q;
    for(i=0;i<s.length();i++)
    {
        ct[s[i]-'a'].PB(i);   
    }
    fact[0]=1;
    n=s.length();
    for(i=1;i<=n;i++)
        fact[i]=(fact[i-1]*i)%M;
    for(i=0;i<=n;i++)
    {
        factinv[i]=inv(fact[i],M);
      //  cout<<factinv[i]<<endl;
    }
    cin >> q;
    for(int a0 = 0; a0 < q; a0++){
        cin>>l>>r;
        l--;r--;
        k=0;
        //cout<<l<<r;
        lol=0;
        ans=1;
        for(i=0;i<26;i++)
        {
            an[i]=(upper_bound(ct[i].begin(),ct[i].end(),r)-ct[i].begin())-(lower_bound(ct[i].begin(),ct[i].end(),l)-ct[i].begin());
           // cout<<(char)i+'a'<<" "<<an[i]<<endl;
            k+=(an[i]/2)*2;
            ans=(ans*factinv[an[i]/2])%M;
            lol+=an[i]%2;
        }
       // cout<<lol<<endl;
        if(lol==0)
       ans=(ans*fact[k/2])%M;
        else
        {
            k++;
            //cout<<ans<<endl;
            ans=(ans*fact[k/2])%M;
            ans=(ans*lol)%M;
        }
        cout<<ans<<endl;
    }
    return 0;
}