#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
const int N = 9973;
const int M = 100010;

int n;
int a, b;
char s[M];
int sub[M];
int ni[M];
int len;
int ans;

void table()
{

    len = strlen(s);
    sub[0] = 1;
    for(int i = 1; i <= len; i++)
    {
        sub[i] = sub[i-1] *(s[i-1]-28);
        sub[i] %= N;
        //printf("%5d%5d\n", sub[i], s[i-1]-28);
    }
}

void Work()
{
    scanf("%s", s);
    table();
    for(int i = 0; i < n; i++)
    {
        scanf("%d%d", &a, &b);
        if(a > b) {int t = a; a = b; b = t;}

        ans = (sub[b]*ni[sub[a-1]])%N;
        printf("%d\n", ans);
    }
}

void init()
{
    ni[0] = 1;
    ni[1] = 1;
    for(int i = 2; i <= N; i++)
    {
        ni[i] = ni[N%i]*(N-N/i) % N;
        //printf("%5d\n", ni[i]);
    }
}

int main()
{
    init();
    while(~scanf("%d", &n))
    {
        Work();
    }
}