#include <bits/stdc++.h>
#define MOD 1000000007
#define pb push_back
#define xx first
#define yy second
#define all(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define repp(i,k,n) for(int i=k;i<n;i++)
#define FAST ios::sync_with_stdio(0);cin.tie(0);
#define MAX_QUERRIES 100005
#define MAX_NUM 1000005

using namespace std;
typedef long long ll;
int sq;

struct query{
  int l,r,ind,block;
  query(){};
  query(int _l,int _r,int _ind,int _block):l(_l),r(_r),ind(_ind),block(_block){};
  bool operator<(const query & q){return (block==q.block)?r<q.r:block<q.block;};
}qq[MAX_QUERRIES];
int result = 0;
int ch[26];
char s[100001];
ll ft[100001];
void fact(){
    ft[0] = ft[1] = 1;
    repp(i,2,100001)
        ft[i] = (i * 1ll * ft[i - 1]) % MOD;
}
ll modpow(ll base, ll exp){
  ll result = 1;
  while (exp > 0) {
    if (exp & 1) result = (result *base) % MOD;
    base = (base * 1ll * base) % MOD;
    exp >>= 1;
  }
  return result;
}
ll inv(ll a){
    return modpow(a,MOD - 2);
}
ll calc(){
    ll res = 1;
    int pr = 0,imp = 0,sum = 0;
    rep(i,26){
        if(ch[i] > 1){
            res = (res * inv(ft[ch[i] >> 1])) % MOD, sum += (ch[i] >> 1);
        }
        if(ch[i] & 1)imp++;
    }
    res = (res * ft[sum]) % MOD;
    if(imp > 0)res = (res * imp) % MOD;
    return res;
}
void add(int a){
    ch[s[a]-'a']++;
}
void remove(int a){
    ch[s[a]-'a']--;
}

int main(){
  int n,q,a,b;
    scanf("%s",s);
  scanf("%d",&q);
    n = strlen(s);
  sq = sqrt(n);
    fact();
  //querries && ans
  ll ans[q];
  for(int i = 0;i<q;i++){
    scanf("%d%d",&a,&b);
    qq[i]=query(a-1,b-1,i,(a-1)/sq);
  }
  sort(qq,qq+q);
  int curl=qq[0].l,curr=qq[0].r;
  for(int i =curl;i<=curr;i++)add(i);
  ans[qq[0].ind] = calc();
  for(int i = 1;i<q;i++){
    while(curl<qq[i].l)remove(curl++);
    while(curl>qq[i].l)add(--curl);
    while(curr<qq[i].r)add(++curr);
    while(curr>qq[i].r)remove(curr--);
    ans[qq[i].ind] = calc();
  }
  for(int i = 0;i<q;i++)printf("%lld\n",ans[i]);
  return 0;
}