#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define pp pair<ll,ll>
#define MP(a,b) make_pair(a,b)
#define F first
#define S second
#define faster ios_base::sync_with_stdio(0);cin.tie(0)
#define M 1000000007
ll fact[100005];
ll power(ll a, ll b)
{
    ll res=1;
    while(b)
    {
        if(b%2==1)
            res=(res*a)%M;
        a=(a*a)%M;
        b/=2;
    }
    return res;
}
ll invMod(ll x)
{
    return power(x,M-2)%M;    
}
int main()
{
    faster;
    ll t,i,j,n,m,k,x,a,b,l,r;
    
    fact[0]=1;
    for(i=1;i<=100000;i++)
    {
        fact[i]=(i%M*fact[i-1]%M)%M;
    }
    /*for(i=1;i<=10;i++)
    {
        cout<<fact[i]<<" ";
    }*/
    //cout<<endl;
    string s;
    cin>>s;
    n=s.length();
    ll c[26][n+1];
    memset(c,0,sizeof(c));
    c[s[0]-'a'][0]=1;
    for(j=0;j<26;j++)
    {
        for(i=1;i<n;i++)
        {
            c[j][i]=c[j][i-1];
            if(s[i]-'a' == j)
            {
                c[j][i]++;
                //cout<<"here"<<endl;
            }
        }
    }
    /*for(j=0;j<26;j++)
    {
        for(i=0;i<n;i++)
            cout<<c[j][i]<<" ";
        cout<<endl;
    }*/
    cin>>t;
    //t=1;
    while(t--)
    {
        cin>>l>>r;
        l--,r--;
        vector<ll> v;
        ll odd=0,sum=0;
        for(i=0;i<26;i++)
        {
            ll cnt=c[i][r];
            if(l!=0)
                cnt-=c[i][l-1];
            //cout<<"cnt of "<<(char)('a'+i)<<" = "<<cnt<<endl;
            if(cnt/2 > 0)
            {
                v.pb(cnt/2);
            }
            sum+=cnt/2;
            sum%=M;
            if(cnt%2)
            {
                //cout<<"odd\n";
                odd++;
                odd %= M;
            }
        }
        ll maxLen = sum;
        //cout<<"half length = "<<maxLen<<endl;
        ll ans=fact[maxLen];
        if(odd)
        {
            ans = (ans%M * odd%M)%M;
        }
        for(i=0;i<v.size();i++)
        {
            ans = (ans%M * invMod(fact[v[i]])%M)%M;
        }
        cout<<ans<<endl;
    }
    return 0;
}