#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#define mod 1000000007
using namespace std;

int dp[100010][27];
long long f[100010];
long long pwr(long long a,long long b)
{
    long long r=1;
    while(b)
    {
        if(b%2)
        {
            r=(r*a)%mod;
        }
        a=(a*a)%mod;
        b/=2;
    }
    return r;
}

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */  
    string s;
    cin>>s;
    int i,j;
    for(i=0;i<s.size();i++)
    {
        dp[i+1][s[i]-'a']++;
        if(i==0)continue;
        for(j=0;j<27;j++)
            dp[i+1][j]+=dp[i][j];
    }
    f[0]=1;
    for(long long i=1;i<=100001;i++)
        f[i]=(i*f[i-1])%mod;
    int q,l,r;
    cin>>q;
    long long x,y,z;
    while(q--)
    {
        scanf("%d %d",&l,&r);
        x=0;y=0;
        for(i=0;i<27;i++)
        {
            if(dp[r][i]-dp[l-1][i]==0) continue;
            if((dp[r][i]-dp[l-1][i])%2)
                {
                   // cout<<i<<"ii\n";
                    y++;
                }
            x+=((dp[r][i]-dp[l-1][i])/2);
        }
        //cout<<x<<" "<<y<<" ";
        x=f[x];
        for(i=0;i<27;i++)
        {
            x=(x*pwr(f[(dp[r][i]-dp[l-1][i])/2],mod-2))%mod;
        }
        if(y>0)
        {
            x=(x*y)%mod;
        }
        cout<<x<<"\n";
    }
    return 0;
}