#include<iostream>
#include<string>
#include<cstring>
#include<cstdio>
using namespace std;
string a;
char arr[100010];
long long F[100010];
int mod = 9973;
long long Qpow(long long m,long long n,long long k)
{
    long long res = 1;
    while(n > 0)
    {
        if(n & 1) 
            res = res * m % k;
        n = n >> 1;
        m = m * m % k;
    }
    return res;
}
int main()
{
    int n;
    while(cin >> n)
    {
        scanf("%s",&arr[1]);
        //a = '!' + a;
        F[0] = 1;
        for(int i = 1;arr[i] != '\0';i ++)
            F[i] = F[i - 1] * (arr[i] - 28) % mod;
        int a,b;
        while(n --)
        {
        //    cin >> a >> b;
        //    cout << F[b] * Qpow(F[a - 1],mod - 2,mod) % mod << endl;
            scanf("%d%d",&a,&b);
            printf("%d\n",F[b] * Qpow(F[a - 1],mod - 2,mod) % mod);
        }
    }
    return 0;
}