#include<cstdio>
#include<cstring>
const int N=100005;
using namespace std;
int c[N];
char s[N];
int maxn;
//char s[];
inline int Lowbit(int x)///其叶子结点的个数
{
    return x&(-x);
}
void change(int i, int x)///i点增量为x
{
    x-=28;
    //  cout<<"x="<<x<<endl;
    while(i<=maxn)
    {
        c[i]*= x;
        c[i]%=9973;
        i += Lowbit(i);
    }
}
int sum(int x, int y) ///区间求和sum(x,y)=sum(1,y)/sum(1,x-1);
{
    int ans = 1;
    for(int i = y; i >= x; )
    {
        if(i-Lowbit(i) >= x)
        {
            ans = (ans*c[i])%9973;
            //ans%=9973;
            i -= Lowbit(i);
        }
        else
        {
            ans = (ans*(s[i-1]-28))%9973;
            //ans *= s[i-1]-28;
            //ans %= 9973;
            i--;
        }
    }
    return ans;
}
int main()
{
    //std::ios::sync_with_stdio(false);
    //std::cin.tie(0);
    int i,j,n;

    while(scanf("%d",&n)!=EOF)
    {

        scanf("%s",s);
        int len = strlen(s);
        maxn = len;
        for(i=1; i<=len; ++i)
            c[i]=1;
        for(i=0; i<len; ++i)
        {
            change(i+1,s[i]);
        }
        int a,b,t;
        while(n--)
        {
            scanf("%d%d",&a,&b);
            if(a>len || b > len)
            {
                printf("%d\n", t);
                //cout<<t<<endl;
                continue;
            }
            //if(a>b) swap(a,b);
            t=sum(a,b);
            printf("%d\n", t);
            //cout<<t<<endl;
        }
    }
    return 0;
}