#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#include<map>
#include<iostream>
using namespace std;
#define ll long long
char s[111111];
ll ans[111111];
const ll mod = 9973;
int qpow(int a, int b)
{
    int r = 1,base = a;
    while(b != 0)
    {
        if(b & 1)
            r = (base * r) % mod;
        base = (base * base) % mod;
        b >>= 1;
    }
    return r;
}
ll tmp[111111];
int main() {
    int n;
    while(~scanf("%d", &n)) {
        scanf("%s", s + 1);
        ans[0] = 1;
        tmp[0] = 1;
        int len = strlen(s + 1);
        for(int i = 1; i <= len; i++) {
            ans[i] = (ans[i - 1] * (s[i] - 28)) % mod;
        }
        for(int i = 1; i <= n; i++) {
            int a, b;
            scanf("%d %d", &a, &b);
            //printf("%I64d %I64d\n", ans[b], tmp[a - 1]);
            printf("%I64d\n", (ans[b] * qpow(ans[a - 1], mod - 2) % mod));
            //printf("%I64d\n", (ans[b - 1] / ans[a - 1]) % mod);
        }
    }
}