#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
#define N 100005
#define P 9973
int n,m,k,l,t,s,ans,T,x,y;
int inv[N],a[N];
char st[N];
int main(){
    inv[1]=1;
    for (int i=2;i<N;i++)inv[i]=inv[P%i]*(P-P/i)%P;
    while(scanf("%d",&n)!=EOF){
        scanf("%s",st+1);
        m=strlen(st+1);
        a[0]=1;
        for (int i=1;i<=m;i++)a[i]=a[i-1]*(st[i]-28)%P;
        for (int i=1;i<=n;i++){
            scanf("%d%d",&x,&y);
            printf("%d\n",a[y]*inv[a[x-1]]%P);
        }
    }
}