#include <iostream>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
#define N 1050
#define M 100050
#define P 9973
int Inv[N],pre[M],prv[M],n,m;char ch[M];
inline int Read()
 {
     int x=0;char y;
     do y=getchar(); while (y<'0'||y>'9');
     do x=x*10+y-'0',y=getchar(); while (y>='0'&&y<='9');
     return x;
 }

int main()
 {
     //freopen("input.txt","r",stdin);
     Inv[0]=Inv[1]=prv[0]=pre[0]=true;
     for (int i=2;i<N;i++) Inv[i]=Inv[P%i]*(P-P/i)%P;
     while (scanf("%d\n",&n)!=EOF)
      {
          gets(ch+1);m=strlen(ch+1);
          for (int i=1;i<=m;i++)
            pre[i]=pre[i-1]*(ch[i]-28)%P,
            prv[i]=prv[i-1]*Inv[ch[i]-28]%P;
          while (n--)
           {
               int k,l;
               scanf("%d%d",&k,&l);
               if (k>l) swap(k,l);
               printf("%d\n",pre[l]*prv[k-1]%P);
           }
      }
     return 0;
 }