#include<cstring>
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
#define maxn 100010
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
typedef long long ll;
ll sum[maxn<<2];
char s[100010];
#define mod 9973
void Pushup(int rt){
    sum[rt] = (sum[rt<<1] * sum[rt<<1|1])%mod ;
}
void Build(int l,int r,int rt){
    if(l == r){
        //cout<<"rt "<<rt<<" "<<s[l]<<endl;
        sum[rt] = (s[l-1] - 28)%mod;
    }
    else{
        int m = (l + r)>>1;
        Build(lson);
        Build(rson);
        Pushup(rt);
    }
}
int Query(int L,int R,int l,int r,int rt){
    if(L <= l && r <=R){
        return sum[rt];
    }
    int m = (l + r)>>1;
    ll ans = 1;
    if(L<=m){
        ans = (ans * Query(L,R,lson))%mod;
    }
    if(R>m){
        ans = (ans * Query(L,R,rson)) %mod;
    }
    return ans;
}
int main(){
    int n,a,b;
    while(scanf("%d",&n)!=EOF){
        scanf("%s",s);
        int len = strlen(s);
        Build(1,len,1);
        for(int i=0;i<n;i++){
            scanf("%d%d",&a,&b);
            ll ans = Query(a,b,1,len,1);
            printf("%I64d\n",ans );
        }
    }

}