#include <bits/stdc++.h>

using namespace std;
#define ll long long 
#define MOD 1000000007


ll freq[26][100005];
ll fact[100005];
ll inv[100005];

ll power(ll base , ll exp){
	ll ans =1;
	while(exp>0){
		if(exp&1)
			ans = (ans * base)%MOD;
		base = (base*base)%MOD;
		exp = exp>>1;
	}
	return ans;
}


void initialize(string s) {
    // This function is called once before all queries.
	for(int i=0;i<s.size();i++){
		freq[s[i]-'a'][i+1]=1;
		for(int j=0;j<26;j++){
			freq[j][i+1] += freq[j][i];
		}
	}
	fact[0] = fact[1]=1;
	inv[0]=inv[1]=1;
	for(int i=2;i<100005;i++){
		fact[i] = (fact[i-1]*i)%MOD;
		inv[i] = (power(fact[i] , MOD-2))%MOD;
	}
}

int answerQuery(int l, int r) {
    // Return the answer for this query modulo 1000000007.
	ll temp[26]={0};
    ll cnt_odd=0;
    ll cnt_even=0;
    ll ans =0;
    for(int i=0;i<26;i++){
    	temp[i] = freq[i][r]-freq[i][l-1];
    	if(temp[i]%2==1){
    		cnt_odd++;
    		temp[i]--;
    	}
    	cnt_even+=(temp[i]/2);
    	
    }
    // length is cnt_even*2+1
    ll len = cnt_even;
    ans = fact[len];
    for(int i=0;i<26;i++){
    	if(temp[i]%2==0){
    		ans = (ans * inv[temp[i]/2])%MOD;
    	}
    }
    if(cnt_odd>0){
    	ans =(ans*cnt_odd)%MOD;
    }
    return ans;
}

int main() {
    string s;
    cin >> s;
    initialize(s);
    int q;
    cin >> q;
    for(int a0 = 0; a0 < q; a0++){
        int l;
        int r;
        cin >> l >> r;
        int result = answerQuery(l, r);
        cout << result << endl;
    }
    return 0;
}