#include <bits/stdc++.h>

using namespace std;

int dp[26][100001];
long long int fact[100001], ifact[100001];

long long int power(long long int x, unsigned int y, unsigned int m)
{
    if (y == 0)
        return 1;
    long long int p = power(x, y/2, m) % m;
    p = (p * p) % m;
 
    return (y%2 == 0)? p : (x * p) % m;
}


long long int modInverse(long long int a, long long int m)
{
    return power(a, m-2, m);
}


void initialize(string s) {
    for(int i=0;s[i];i++) {
        for(int j=0;j<26;j++) {
            dp[j][i+1] = dp[j][i];
        }
        dp[s[i]-'a'][i+1] = dp[s[i]-'a'][i] + 1;
    }
    fact[0] = 1;
    ifact[0] = 1;
    for(int i=1;i<=100000;i++) {
        fact[i] = (fact[i-1]*i)%1000000007;
        ifact[i] = (ifact[i-1]*modInverse(i, 1000000007))%1000000007;
    }
    //for(int i=0;i<10;i++) cout<<ifact[i]<<' ';
    //cout<<modInverse(2, 1000000007);
}

int answerQuery(int l, int r) {
    if(r-l==0) return 1;
    int len = 0, odf = 0;
    long long int p = 1;
    for(int i=0;i<26;i++) {
        int d = dp[i][r]-dp[i][l-1];
        if(d%2) {
            odf += 1;
        }
        len += (d/2);
        p = (p*ifact[d/2])%1000000007;
    }
    p = (p*fact[len])%1000000007;
    if(odf) p = (p*odf)%1000000007;
    return p;
}

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;
}