#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
const int M=100005,N=1000000007;
int n,m,x,y,a[M],freq[26];
ll fact[M];
string s,z;
ll sum;
int main()
{
    cin>>s;
    int q;
    n=s.size();
    cin>>q;
    fact[1]=1;
    for(int i=2;i<M;i++)fact[i]=fact[i-1]*i%N;
    while(q--){
        int l,r;
        scanf("%d%d",&l,&r);
        l--;r--;
        memset(freq,0,sizeof freq);
        for(int i=l;i<=r;i++){
            freq[s[i]-'a']++;
        }
        int odd=0,even=0,sum=0;
        for(int i=0;i<26;i++){
            if(freq[i]%2)odd++;
            sum+=freq[i]/2;
        }
        ll k=fact[sum]*max(1,odd);
        k%=N;
        cout<<k<<endl;
    }
    return 0;
}