/* dsingh_24 */

#include<bits/stdc++.h>
#define ll          long long
#define pb          push_back
#define pf          push_front
#define endl    '\n'
#define pii         pair<ll ,ll>
#define vll          vector<ll>
#define all(a)      (a).begin(),(a).end()
#define F           first
#define S           second
#define sz(x)       (ll int)x.size()
#define hell        1000000007LL
#define rep(i,a,b)  for(ll int i=a;i<b;i++)
#define lbnd        lower_bound
#define ubnd        upper_bound
#define bs          binary_search
#define mp          make_pair
#define ios         ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;

#define N  100005
ll expo(ll base, ll exponent, ll mod) {                //return base^exponent modulo modulus
    ll ans = 1;
    while(exponent !=0 ) {
        if((exponent&1) == 1) {
            ans = ans*base ;
            ans = ans%mod;
        }
        base = base*base;
        base %= mod;
        exponent>>= 1;
    }
    return ans%mod;
}
ll inv(ll x)
{
  return expo(x,hell-2,hell);
}
ll a[27][100005],f[100005];
int main()
{
  ios
  ll i,j,q;
  string s;
  cin>>s>>q;
  f[0]=1;
  for(i=1;i<=100003;i++)
  {
    f[i]=(i*f[i-1])%hell;
  }
  for(i=0;i<s.size();i++)
  {
    a[s[i]-'a'][i]++;
  }
  for(i=0;i<26;i++)
  {
    for(j=1;j<s.size();j++)
    {
      a[i][j]=a[i][j]+a[i][j-1];
    }
  }
  while(q--)
  {
    ll x,y;
    cin>>x>>y;
    if(x==y){cout<<"1\n";continue;}
    x-=2;y--;
    ll in[27]={0},o=0,ss=0;
    for(i=0;i<26;i++)
    {
      if(x==-1)in[i]=a[i][y];else
      in[i]=a[i][y]-a[i][x];
    //  cout<<a[i][y]-a[i][x]<<"\n";
      if(in[i]%2)o++;
      in[i]/=2;
      ss+=in[i];
    }
    ll ans=f[ss];
    for(i=0;i<26;i++)
    {
      if(in[i]!=0)
      ans*=inv(f[in[i]]);
      ans%=hell;
    }
    if(!o)cout<<ans<<"\n";else
    cout<<(ans*o)%hell<<"\n";
  }
  return 0;
}