#include<cstdio>  
#include<cstring>  
#include<algorithm>  
using namespace std;  
typedef long long ll;  
const ll maxn=100005;  
const ll mod=9973;  
ll sum[maxn],inv[maxn],re[maxn];  
char s[maxn];  
int main()  
{  
    inv[1]=1;  
    for(int i=2;i<maxn;++i)  
    {  
        inv[i]=inv[mod%i]*(mod-mod/i)%mod;  
    }  
    int n;  
    //freopen("shuju.txt","r",stdin);  
    while(~scanf("%d",&n))  
    {  
        scanf("%s",s+1);  
        sum[0]=re[0]=1;  
        for(int i=1;s[i]!=0;++i)  
        {  
            sum[i]=(sum[i-1]*(s[i]-28))%mod;  
            re[i]=inv[sum[i]];  
        }  
        for(int i=0;i<n;++i)  
        {  
            ll a,b;  
            scanf("%lld%lld",&a,&b);  
            ll tp=re[a-1];  
            printf("%I64d\n",(sum[b]*tp)%mod);  
        }  
    }  
    return 0;  
}