#include <bits/stdc++.h>

using namespace std;

#define mm 1000000007
#define half 50001

vector<vector<int> > count_to_here;
vector<unsigned long long> fact(half);

int len;

unsigned long long inv(int i){
    if (i<2) return i;
    
    int exp = mm - 2;
    unsigned long long pow = i;
    unsigned long long ret = 1;
    
    while (exp){
        if (exp & 1){
            ret = (ret * pow) % mm;
        }
        pow = (pow*pow) % mm;
        exp >>= 1;
    }
    
    return ret;
}
void initialize(string s) {
    // This function is called once before all queries.
    len = s.size();
    count_to_here.resize(len+1, vector<int>(26,0));
    
    for (int i = 1; i<= len; i++){
        count_to_here[i] = count_to_here[i-1];
        count_to_here[i][s[i-1]-'a']++;
    }

    fact[0] = 1;
    
    for (int i=1; i<half; ++i){
        fact[i] = (fact[i-1] * i) % mm;
    }
}


int answerQuery(int l, int r) {
    // Return the answer for this query modulo 1000000007.
    unsigned long long remain = 0;
    unsigned long long sum = 0;
    unsigned long long det = 1;
    int l1 = l-1;
    
    for (char z = 0; z<26; z++){
        unsigned long long tmp = count_to_here[r][z] - count_to_here[l1][z];

        remain += tmp & 1;
        tmp >>= 1;       
        det = (det * fact[tmp]) % mm;
        sum += tmp;
    }
    
    unsigned long long ret = (fact[sum] * inv(det)) % mm;
    return ((remain > 1) ? ( (ret * remain)%mm ) 
                         : ret);
}

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