//#include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>

using namespace std;

#define N 100010
#define mod 9973

int h[N];
char s[N];
int qpow(int x, int k){
    int ret = 1;
    for(; k; k >>= 1){
        if(k & 1) ret = ret * x % mod;
        x = x * x % mod;
    }
    return ret;
}
int main(){
    int m;
    while(scanf("%d", &m) != EOF){
        scanf("%s", s + 1);
        h[0] = 1;
        int n = strlen(s + 1);
        for(int i = 1; i <= n; ++i)
            h[i] = h[i-1] * (s[i] - 28) % mod;
        while(m--){
            int l, r;
            scanf("%d%d", &l, &r);
            printf("%d\n", h[r] * qpow(h[l-1], mod - 2) % mod);
        }
    }
    return 0;
}