#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
using namespace std;

const int inf = 0x3f3f3f3f;
const int N = 100000 + 10;
const int M = N * N;
const int mod = 9973;
const int K = 28;

char str[N];

int S[N];

int ksm(int a, int k) {
    int ans = 1;
    while(k) {
        if(k&1) ans = ans * a % mod;
        a = a * a % mod;
        k >>= 1;
    }
    return ans;
}

int main()
{
#ifdef LOCAL
    freopen("in", "r", stdin);
#endif
    int n;
    while(~scanf("%d", &n)) {
        scanf("%s", str+1);
        int len = strlen(str+1);
        S[0] = 1;
        for(int i = 1; i <= len; ++i) {
            S[i] = S[i-1] * (str[i]-K) % mod;
        }
        while(n--) {
            int a, b;
            scanf("%d%d", &a, &b);
            printf("%d\n", S[b] * ksm(S[a-1], mod-2) % mod);
        }
    }
    return 0;
}