#include<bits/stdc++.h>
    using namespace std;
    #define ll long long
    #define ull unsigned long long
    #define ld long double
    #define pi pair<ll,ll>
    #define pii vector<pair<ll,ll> >
    #define v vector
    #define vi vector<ll>
    #define f(a,i,n) for(int i=a;i<n;i++)
    #define pb push_back
    #define mp make_pair
    #define MOD 1000000007
    #define MAX 1000001
    #define all(x) x.begin(),x.end()
    const ll inf=(ll) 1e18;
     
    ll gcd(ll a, ll b) {ll r; while (b) {r = a % b; a = b; b = r;} return a;}
    ll lcm(ll a, ll b) {return a / gcd(a, b) * b;}
    ll fpow(ll n, ll k, int p = MOD) {ll r = 1; for (; k; k >>= 1) {if (k & 1) r = r * n % p; n = n * n % p;} return r;}
    int inv(int a, int p = MOD) {return fpow(a, p - 2, p);}
    ll spf[MAX+1];
      void sieve()//complexity = approx 3*10^6
        {
            f(1,i,MAX) {spf[i]=i;} 
            for(ll i=2;i<MAX;i+=2){spf[i]=2;}
            for(ll i=3;i<MAX;i+=2)
            {
                if(spf[i]==i) //if i is prime mark its multiples with spf as i
                {
                    for(ll j=i*i;j<MAX;j+=i)
                    {
                        spf[j]=min(i,(ll)spf[j]);
                    }
                }
            }
        }

    ll facto[100001];

    ll choose(ll n,ll r)
    {
    	ll n1=facto[n];
    	ll n2=facto[r];
    	ll n3=facto[n-r];

    	ll ans=(n1*inv(n2))%MOD;
    	ans=(ans*inv(n3))%MOD;

    	return ans;
    }
    int main()
    {
    	facto[0]=1;
    	facto[1]=1;
    	f(2,i,100001) facto[i]=(facto[i-1]%MOD * i%MOD)%MOD;
    	string a;
    	cin>>a;
    	ll n=a.size();
    	v<vi>freq(26,vi(n,0));
    	v<vi>pre(26,vi(n,0));
    	
    	f(0,i,n)
    	{
    		freq[a[i]-'a'][i]++;
    	}	
    	f(0,i,26) pre[i][0]=freq[i][0]; 
    	f(0,i,26)
    	{
    		f(1,j,n)
    		{
    			pre[i][j]=pre[i][j-1]+freq[i][j];
    		}
    	}
    	/*f(0,i,26)
    	{
    		f(0,j,n)
    		{
    			cout<<pre[i][j]<<" ";
    		}
    		cout<<endl;
    	}*/
    	ll q;
    	cin>>q;
    	while(q--)
    	{
    		ll l,r;
    		cin>>l>>r;
    		l--;r--;
    		vi freq_in_range(26,0);
    		if(l!=0)
    		{
	    		f(0,i,26)
	    		{
	    			freq_in_range[i]=pre[i][r]-pre[i][l-1];
	    		}
    		}
    		else
    		{
    			f(0,i,26)
	    		{
	    			freq_in_range[i]=pre[i][r];
	    			//cout<<freq_in_range[i]<<" ";
	    		}
	    		//cout<<endl;
    		}
    		ll maxlen=0,flag=0,oddcnt=0;
    		f(0,i,26)
    		{
    			if(freq_in_range[i]%2==0) maxlen+=(freq_in_range[i]);
    			else {flag=1;maxlen+=(freq_in_range[i]-1);oddcnt++;}
    		}
    		if(flag==1) maxlen++;
    		ll ans=1;
    		if(maxlen%2==0)
    		{
    			ll spaceleft=maxlen/2;
    			f(0,i,26)
    			{
    				ll tobefilled=freq_in_range[i]/2;
    				if(tobefilled==0) continue;
    				ans=(ans%MOD*choose(spaceleft,tobefilled)%MOD)%MOD;
    				spaceleft-=tobefilled;
    			}
    			cout<<ans<<endl;
    			continue;
    		}	
    		else
    		{
    			ll spaceleft=maxlen/2;
    			f(0,i,26)
    			{
    				ll tobefilled=freq_in_range[i]/2;
    				//cout<<spaceleft<<" "<<tobefilled<<endl;
    				if(tobefilled==0) continue;
    				ans=(ans%MOD*choose(spaceleft,tobefilled)%MOD)%MOD;
    				spaceleft-=tobefilled;
    			}
    			ans=(ans*oddcnt)%MOD;
    			cout<<ans<<endl;
    			continue;
    		}
    	}
    }