#include <iostream>
#include <string>
#include <stdio.h>
#include <map>
#include <cstring>
using namespace std;

#define LL long long
const int mod=9973;

int main()
{
     LL inverse[mod+7];
    inverse[0]=0;inverse[1]=1;
    for(int i=2; i<mod; i++)
       inverse[i]=(-(mod/i) * inverse[mod%i])%mod + mod;
    int n;
    int a,b;
    int c[100010];
    string s;
     while(cin>>n)
     {
         cin>>s;
         c[0]=1;
         for(int j=1;j<=s.length();j++)
            c[j]=(c[j-1]*(s[j-1]-28))%mod;
         while(n--)
         {
             cin>>a>>b;
             cout<<(c[b]%mod)*inverse[c[a-1]%mod]%mod<<endl;
         }
     }

    return 0;
}