#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
#define FOR(i, n, m) for(int i = n; i <= m; i++)
#define REP(i, n, m) for(int i = n; i >= m; i--)
#define PB push_back
#define MP make_pair
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
const int maxn = 100010;
const ll mod = 9973;

ll inv[mod+10];
ll inv_pre[maxn], pre[maxn];

ll Fast_Multi(ll a, ll k, ll mod){
        ll ans = 1;
        while(k > 0){
            if(k&1) ans = ans * a % mod;
            k >>= 1;
            a = a * a % mod;
            }
        return ans % mod;
        }

void Preprocess(){
        FOR(i, 1, mod-1) inv[i] = Fast_Multi(i, mod-2, mod);
        //FOR(i, 1, 10){cout<<inv[i]<<" ";cout<<endl;}
        }

void Init(){
        memset(inv_pre, 0, sizeof(inv_pre));
        memset(pre, 0, sizeof(pre));
        inv_pre[0] = pre[0] = 1;
        }

char str[maxn];
int main(){
        int n;
        Preprocess();
        Init();
        while(scanf("%d", &n)!=EOF){
            scanf("%s", str);
            int len=strlen(str);
            //cout<<"convert"<<endl;
            FOR(i, 0, len-1){
                //cout<<str[i]-28 << " ";
                pre[i+1] = pre[i] * (str[i] - 28) % mod;
                inv_pre[i+1] = inv_pre[i] * inv[str[i] - 28] % mod;
                }
            //cout<<endl;
            int a, b;
            while(n--){
                scanf("%d%d",&a,&b);
                printf("%d\n", pre[b]*inv_pre[a-1]%mod);
                }
            }
        return 0;
}