#include <bits/stdc++.h>

using namespace std;

typedef long long llong;
llong MOD=1e9+7;
int sz;
vector<vector<int>> info;
vector<llong> factMod___(100000,1);
vector<llong> factModInv(100000);

llong powMod(llong n, int p) {
    if(!p) return 1;
    if(p==1) return n;
    if(p==2) return (n*n)%MOD;
    
    return powMod(powMod(n, p/2),2)*(p%2 ? n:1)%MOD;
}

void initialize(string s) {
    // This function is called once before all queries.
    sz=s.size();
    vector<int> cnts(26);
    for(int i=0; i<sz; ++i) {
        ++cnts[s[i]-'a'];
        info.push_back(cnts);
    }
    
    for(int i=2; i<100000; ++i)
        factMod___[i]=(factMod___[i-1]*i)%MOD;
    
    factModInv[99999] = powMod(factMod___[99999], MOD-2);
    for(llong i=99999; i>0; --i)
        factModInv[i-1] = factModInv[i]*i%MOD;
}

int answerQuery(int l, int r) {
    // Return the answer for this query modulo 1000000007.
    --r,--l;
    vector<int> cnts = info[r];
    
    if(l)
        for(int i=0; i<26; ++i)
            cnts[i] -= info[l-1][i];
    
   
    llong odds=0, evens=0;
    vector<llong> evenV;
    
    for(int i: cnts) {
        if(i>1)
            evens+=i/2, evenV.push_back(i/2);
        if(i%2)
            ++odds;
    }
    
    
    
    llong ans=1;
    ans *= factMod___[evens];
    for(int i: evenV)
        ans = (ans*factModInv[i])%MOD;
    
    if(odds)
        ans = (ans*odds)%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;
}