#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <iostream>
using namespace std;

typedef long double ld;
typedef long long ll;
typedef pair<int, int> pii;
#define X first
#define Y second
const int N = 1e5 + 100;
const int MOD = 9973;
char str[N];
int f[N];
int inv(int x) {
    int ans = 1;
    int c = MOD - 2;
    while(c) {
        if(c & 1) ans = ans * x % MOD;
        x = x * x % MOD;
        c >>= 1;
    }
    return ans;
}
int main() {
    int m;
    while(~ scanf("%d", &m)) {
        
        scanf("%s", str + 1);
        int n = strlen(str + 1);
        f[0] = 1;
        for(int i = 1; i <= n; i ++) {
            f[i] = f[i - 1] * (str[i] - 28) % MOD;
        }
        for(int i = 1; i <= m; i ++) {
            int l, r;
            scanf("%d%d", &l, &r);
            printf("%d\n", f[r] * inv(f[l - 1]) % MOD);
        }

    }
}