#include <iostream>
    #include <cstdio>
    #include <algorithm>
    #include <cstdlib>
    #include <cstring>
    #include <string.h>
    #include <string>
    #include <map>
    #include <queue>
    #include <deque>
    #include <cmath>
    #include <math.h>
    #include <vector>
    #include <ctime>
    #include <cctype>
    #include <stack>
    #include <set>
    #include <bitset>
    #include <functional>
    #include <numeric>
    #include <stdexcept>
    #include <utility> 
    using namespace std;
    #define ll long long 
    #define m0(a) memset(a, 0, sizeof(a))
    #define m1(a) memset(a, -1, sizeof(a))
    #define C1(x)  cout<<x<<endl
    #define C2(x,y)  cout<<x<<" "<<y<<endl
    #define C3(x,y,z)  cout<<x<<" "<<y<<" "<<z<<endl
    #define C4(x,y,z,zz)  cout<<x<<" "<<y<<" "<<z<<" "<<zz<<endl
    #define min(x,y) ((x)>(y)?(y):(x))
    #define max(x,y) ((x)>(y)?(x):(y))
    #define r() (rand()/(double)(RAND_MAX))
    struct stu
    {
        int x,y,z;
        bool operator < (const stu &b) const
        {
            return x<b.x;    
        }
    };
    const int inf = 0x3f3f3f3f; 
    const double eps = 1e-15;
    const double pi = acos((double)-1) ;
    const int maxn = 100100;
    const ll M = 9973;
    const int L=110000;
    int i,j,k,l,m,n,x,y,z; 
    ll ans,num;
    char a[maxn];
    ll b[maxn];
    int v[maxn]={0};
    int dx[4]={0,0,1,-1};
    int dy[4]={1,-1,0,0};
    ll gcd(ll x,ll y)
    {
        if (x==0 || y==0)  return x+y;
        return (x%y==0)?y:gcd(y,x%y);
    }
    string add(string a,string b)//只限两个非负整数相加
    {
        string ans;
        int na[L]={0},nb[L]={0};
        int la=a.size(),lb=b.size();
        for(int i=0;i<la;i++) na[la-1-i]=a[i]-'0';
        for(int i=0;i<lb;i++) nb[lb-1-i]=b[i]-'0';
        int lmax=la>lb?la:lb;
        for(int i=0;i<lmax;i++) na[i]+=nb[i],na[i+1]+=na[i]/10,na[i]%=10;
        if(na[lmax]) lmax++;
        for(int i=lmax-1;i>=0;i--) ans+=na[i]+'0';
        return ans;
    }
    
    long long extend_gcd(long long a,long long b,long long &x,long long &y)
    {
        if(a==0&&b==0) return -1;//无最大公约数
        if(b==0){x=1;y=0;return a;}
        long long d=extend_gcd(b,a%b,y,x);
        y-=a/b*x;
        return d;
    }
    long long mod_reverse(long long a,long long n)//MOD n
    {
        long long x,y;
        long long d=extend_gcd(a,n,x,y);
        if(d==1) return (x%n+n)%n;
        else return 0;
    }
    
    int main () 
    {
        srand((unsigned)time(NULL));
        #ifdef ONLINE_JUDGE
        
        #else
        
            //freopen("in.in","r",stdin);
            //freopen("in.out","w",stdout);
        
        #endif
        int cas;
    
        
        while (scanf("%d",&n)!=EOF)
        {
            getchar();
            gets(a);
            l=strlen(a);
            b[0]=(a[0]-28)%M;
            for (int i=1;i<l;i++) b[i]=(b[i-1]*(a[i]-28))%M;
            
            for (int i=1;i<=n;i++)
            {
                scanf("%d%d",&x,&y);
                
                
                {
            
                    if (x>y) swap(x,y);
                    ans=1;
                    if (x>=2) ans=( b[y-1] * mod_reverse(b[x-2],M))%M;
                    else if (x==1)ans=(b[y-1])%M;
                    C1(ans);
                    num=ans;
                }
            }
            
        }
        /*
        scanf("%d",&cas);
        for (int casi=1;casi<=cas;casi++)
        {
            //scanf("%d",&n);
            printf("%d\n",casi);
        }*/
    
        return 0;
    }