#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define MAX 100100
#define mod 9973
using namespace std;
typedef long long LL;
char s[MAX];
int pre[MAX];
int n;
int extend_gcd(int a, int b, int &x, int &y) {
    if (b == 0) {
        x = 1;
        y = 0;
        return a;
    }
    int d = extend_gcd(b, a % b, y, x);
    y -= a / b * x;
    return d;
}
int mod_reverse(int a, int n) {
    int x, y;
    extend_gcd(a, n, x, y);
    return (x % n + n) % n;
}
int main() {
    while (scanf("%d", &n) != EOF) {
        scanf("%s", s);
        int m = (int)strlen(s);
        pre[0] = 1;
        for (int i = 1; i <= m; ++i) {
            pre[i] = (pre[i - 1] * (s[i - 1] - 28)) % mod;
        }
        for (int i = 1; i <= n; ++i) {
            int a, b;
            scanf("%d%d", &a, &b);
            int ans = mod_reverse(pre[a - 1], mod);
            printf("%d\n", (ans * pre[b]) % mod);
        }
    }
    return 0;
}