#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
const int N=100100;
const int mod=9973;
char s[N];int n,m,u,v;
int sum[N],ans;
int power(ll a,ll b)
{
    ll ans=1;
    for (;b;b>>=1,a=(a*a)%(ll)mod)
    if(b&1)ans=(ans*a)%(ll)mod;
    return ans;
}
int main()
{
    sum[0]=1;
    while(scanf("%d",&n)!=EOF)
    {
        scanf("%s",s+1);m=strlen(s+1);
        for (int i=1;i<=m;++i)
        {
            sum[i]=(ll)(sum[i-1]*(s[i]-28))%mod;
            s[i]=0;
        }
        for (int i=1;i<=n;++i)
        {
            scanf("%d%d",&u,&v);
            ans=sum[v]*power(sum[u-1],mod-2)%(ll)mod;
            printf("%d\n",ans);
        }
    }
    return 0;
}