#include <cstdio>
#include <cstring>
#include <queue>
#include <iostream>
using namespace std;
const int N = 1e5+10;
const int M = 1e6+10;
typedef long long llg;
const llg oo = 9973;
long long extend_gcd(long long a,long long b,long long &x,long long &y)
{
    if(a==0&&b==0) return -1;//无最大公约数
    if(b==0){x=1;y=0;return a;}
    long long d=extend_gcd(b,a%b,y,x);
    y-=a/b*x;
    return d;
}
//*********求逆元素*******************
//ax = 1(mod n)
long long mod_reverse(long long a,long long n)
{
    long long x,y;
    long long d=extend_gcd(a,n,x,y);
    if(d==1) return (x%n+n)%n;
    else return -1;
}
int re[10010];
int Hash[N];
char s[N];
int main()
{
    re[1] = 1;
    for (int i = 2; i<oo; i++)    re[i] = re[oo%i]*(oo-oo/i)%oo;
    //for(int i=1;i<oo;i++) re[i] = mod_reverse(i,oo);
    int n;
    while(~scanf("%d",&n))
    {
        scanf("%s",&s);
        Hash[0] = 1;
        for(int i=0;s[i];i++)
        {
            Hash[i+1] = Hash[i] * (s[i] - 28) % oo;
            //cout<<Hash[i+1]<<endl;
        }
        for(int i=0;i<n;i++)
        {
            int x,y;
            scanf("%d%d",&x,&y);
            int ans = Hash[y] * re[Hash[x-1] ] % oo;
            printf("%d\n",ans);
        }
    }
    return 0;
}