#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
const int MOD = 9973;
const int MAXN = 1e5 + 10;

char str[MAXN];
int a[MAXN], inv[MAXN];

void Init()
{
    inv[0] = inv[1] = 1;
    for(int i = 2; i <= MOD; i++)
        inv[i] = (MOD - MOD / i) * inv[MOD % i] % MOD;
}

int main()
{
    //freopen("in.txt", "r", stdin);
    Init();
    int n;
    while(scanf("%d", &n) != EOF)
    {
        scanf("%s", str + 1);
        int len = strlen(str + 1);
        a[0] = 1;
        for(int i = 1; i <= len; i++)
            a[i] = a[i - 1] * (str[i] - 28) % MOD;
        while(n--)
        {
            int l, r;
            scanf("%d%d", &l, &r);
            if(l > r) swap(l, r);
            ll ans = (ll)a[r] * inv[a[l - 1]] % MOD;
            printf("%I64d\n", ans);
        }
    }
    return 0;
}