#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
char a[100005];
long long int extend_gcd(long long int a,long long int b,long long int &x,long long int &y){
    if(b==0){
        x=1;y=0;
        return a;
    }
    else{
        int r=extend_gcd(b,a%b,y,x);
        y-=x*(a/b);
        return r;
    }
}

int main(){
    int n;
    long long int qian[100005];
    while(scanf("%d",&n)!=EOF){
        scanf("%s",&a);
        int len=strlen(a);
        qian[0]=1;
        qian[1]=a[0]-28;
        for(int i=1;i<len;i++){
            qian[i+1]=(qian[i]*(a[i]-28))%9973;
        }
        for(int i=1;i<=n;i++){
            int x,y;
            scanf("%d %d",&x,&y);
            long long int r,t;
            long long int s=extend_gcd(qian[x-1],9973,r,t);
            long long int x0=r*qian[y]/s;
            long long int out=x0%9973;
            while(out<0) out+=9973/s;
            cout<<out%9973<<endl;
        }
    }
    return 0;
}