#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define mod 9973
using namespace std;
int n,sum[100010],inv[10010],x,y,len;
char s[100010];
int main()
{
    inv[1]=1;
    for (int i=2;i<mod;++i) inv[i]=mod-mod/i*inv[mod % i] % mod;
    while (scanf("%d",&n)!=EOF)
    {
        scanf("%s",s+1);len=strlen(s+1);
        sum[0]=1;
        for (int i=1;i<=len;++i) sum[i]=sum[i-1] * (s[i]-28) % mod;
        for (int i=1;i<=n;++i)
        {
            scanf("%d%d",&x,&y);
            printf("%d\n",sum[y] * inv[sum[x-1]] % mod);
        }
    }
    return 0;
}