#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#define LL __int64
using namespace std;
char str[100010];
LL  arr[100010];
const int mod = 9973;

LL qpow(LL x, LL y, LL mod)
{
    x %= mod;
    LL ans = 1;
    for(;y > 0; y>>= 1)
    {
        if(y & 1)
        {
            ans *= x;
            ans %= mod;
        }
        x *= x;
        x %= mod;
    }
    return ans;
}
//  (x / y)%mod
LL div(LL x, LL y, LL mod)
{
    x %= mod;
    LL ans = x * qpow(y, mod - 2, mod);
    ans %= mod;
    return ans;
}

int main()
{
    int n,m,i,j,k,a,b;
    while(~scanf("%d",&n)){
        scanf("%s",str+1);
        int len = strlen(str+1);
        arr[0] = 1;
        for(i = 1;i < len+1;++ i){
            if(i==1)
                arr[i] = (str[i]-28);
            else
                arr[i] = (arr[i-1]*(str[i]-28))%mod;
        }
        while(n--){
            scanf("%d%d",&a,&b);
            cout<<div(arr[b],arr[a-1],mod)<<endl;
        }
    }
    return 0;
}