#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<algorithm>
#include<map>

int const N = 100005;
#define ll long long
#define mod 9973

using namespace std;

char s[N];
int l;
int mul[N];

void ini()
{
    mul[0] = 1;
    int i;
    for(i = 1;i < l + 1;i++){
        mul[i] = ( mul[i - 1] * (s[i] - 28) ) %mod;
    }
}

int quickmod(int x,int n)
{
    int ret = 1;
    while(n){
        if(n & 1){
            ret = (ret * x) % mod;
        }
        n /= 2;
        x = (x * x) % mod;
    }
    return ret;
}

int main()
{
    //freopen("in.txt","r",stdin);
    int n,a,b,ans;
    while(scanf("%d",&n) != EOF)
    {
        scanf("%s",s + 1);
        l = strlen(s + 1);
        ini();
        while(n --){
            scanf("%d%d",&a,&b);
            ans = (mul[b] * quickmod(mul[ a - 1 ],mod - 2) ) %mod;
            printf("%d\n",ans);
        }
    }


    return 0;
}