#include #include #include #include #define mod 9973 #define N 200000 using namespace std; int len, q; char ch[N]; int f[N]; int powi(int a, int b) { int c = 1; while (b) { if (b & 1) (c *= a) %= mod; (a *= a) %= mod; b /= 2; } return c; } int main() { while (scanf("%d", &q) == 1) { scanf("%s", ch + 1); len = strlen(ch + 1); f[0] = 1; for (int i = 1; i <= len; ++ i) f[i] = f[i - 1] * (ch[i] - 28) % mod; for (int i = 1; i <= q; ++ i) { int a, b; scanf("%d%d", &a, &b); printf("%d\n", f[b] * powi(f[a - 1], mod - 2) % mod); } } }