#include <stdio.h>
#include <algorithm>
using namespace std;

const int MOD = 9973;
int pow_m(int a, int n) {
    int ret = 1;
    int tmp = a%MOD;
    while(n) {
        if (n & 1) {
            ret = ret*tmp%MOD;
        }
        n >>= 1;
        tmp = tmp*tmp%MOD;
    }
    return ret;
}
const int MAXN = 100010;
int sum[MAXN];
int rsum[MAXN];
int a[MAXN];
char str[MAXN];

int main() {
    int n,m;
    while(scanf("%d", &m) == 1) {
        scanf("%s", str);
        n = strlen(str);
        for(int i = 1;i <= n;i++) {
            a[i] = (str[i-1] - 28 + MOD)%MOD;
        }
        sum[0] = rsum[0] = 1;
        for(int i = 1;i <= n;i++) {
            sum[i] = sum[i-1]*a[i]%MOD;
            rsum[i] = rsum[i-1]*pow_m(a[i], MOD-2)%MOD;
        }
        int l,r;
        while(m--) {
            scanf("%d%d",&l,&r);
            printf("%d\n", sum[r] * rsum[l-1]%MOD);
        }
    }
    return 0;
}