#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
using namespace std;
const int N=1E5+5;
const int MOD=9973;
int n,f[N],len,x,y;
char s[N];

int find(int x,int n)
{
    if (!n) return 1;
    int ans=find(x,n/2);
    ans=ans*ans%MOD;
    if (n&1) ans=ans*x%MOD;
    return ans;    
}

int main()
{
    while (cin>>n)    
    {
        scanf("%s",s+1);
        len=strlen(s+1); f[0]=1;
        for (int i=1;i<=len;i++) f[i]=f[i-1]*(s[i]-28)%MOD;
        for (int i=1;i<=n;i++)
        {
            scanf("%d%d",&x,&y);
            printf("%d\n",f[y]*find(f[x-1],MOD-2)%MOD);
        }
    }
}