#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int mod=9973;
const int maxn=100005;
char s[maxn];
int sum[maxn];
int qpow(int m,int n)
{
    int res=1;
    while (n)
    {
        if (n&1)
            res=(res*m%mod)%mod;
        m = (m*m%mod)%mod;
        n /= 2;
    }
    return res;
}
int main()
{
    int n,a,b,ans,t;
    while(~scanf("%d",&n))
    {
        scanf("%s",s+1);
        sum[0]=1;
        for(int i=1;s[i];i++)
            sum[i]=(sum[i-1]*(s[i]-28)%mod)%mod;
        while(n--)
        {
            scanf("%d%d",&a,&b);
            t=qpow(sum[a-1],mod-2);
            ans=(sum[b]*t%mod)%mod;
            printf("%d\n",ans);
        }

    }
    return 0;
}