#include <cstdio>

#include <cmath>

#include <cstring>

#include <iostream>

#include <algorithm>

#include <queue>

#include <vector>

#include <map>



using namespace std;



typedef long long LL;


int n,len,l,r,dq;
int f[100005],g[100005];
char s[100005];
const int mod=9973;
int powmod(int a,int b,int c)
{
    int ans=1;
    while (b>0)
    {
        if (b&1) ans=ans*a%c;
        a=a*a%c;
        b/=2;    
    }
    return ans;
}

int main()

{
    while (scanf("%d",&n)!=EOF)
    {
        scanf("%s",s+1);
        len=strlen(s+1);
        f[0]=1;g[0]=1;
        for (int i=1;i<=len;++i)
        {
            dq=s[i]-28;
            f[i]=f[i-1]*dq%mod;
            g[i]=powmod(f[i],mod-2,mod);
        }
        for (int i=1;i<=n;++i)
        {
            scanf("%d%d",&l,&r);
            dq=f[r];
            dq=dq*g[l-1]%mod;
            printf("%d\n",dq);
        }
    }

    return 0;

}