#include<cstdio>
#include<cstring>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#define rep(i,j,k) for(int i=(int)j;i<=(int)k;i++)
#define per(i,j,k) for(int i=(int)j;i>=(int)k;i--)
using namespace std;
typedef long long LL;
typedef double db;
const int P=9973;
inline int Pow(int a,int b){
    int c=1;
    for(;b;b>>=1,a=a*1ll*a%P)if(b&1)c=c*1ll*a%P;
    return c;
}
const int N=100005;
char str[N];
int a[N];
int n;
int main(){
    int T;
    while(scanf("%d",&T)!=EOF){
        scanf("%s",str+1);
        a[0]=1;
        n=strlen(str+1);
        rep(i,1,n)a[i]=a[i-1]*(str[i]-28)%P;
        while(T--){
            int x,y;scanf("%d%d",&x,&y);
            printf("%d\n",a[y]*Pow(a[x-1],P-2)%P);
        }
    }
    return 0;
}