#include <stdio.h>
#include <map>
#include <vector>
#include <queue>
#include <cstring>
#include <algorithm>
#include <string>
#include <cstdlib>
#include <iostream>
#include <cmath>
#include <set>
#include <ctime>
#include <bitset>

#define ll __int64
#define ull unsigned long long
#define maxn 2000
#define INF 99999999
#define eps 1e-8
#define f_min(a,b) (a<b?a:b)
#define mod 9973
using namespace std;

int n,l,r;
char s[101000];
int ans[101000];
int inv[101000];

void init(){
    inv[1]=1;
    for (int i=2;i<mod;i++){
        inv[i]=(mod-mod/i)*inv[mod%i]%mod;
    }
}

int main(){
    init();
    while (scanf("%d",&n)!=EOF){
        scanf("%s",s+1);
        ans[0]=1;
        for (int i=1;s[i];i++){
            ans[i]=ans[i-1]*(s[i]-28)%mod;
        }
        while (n--){
            scanf("%d%d",&l,&r);
            printf("%d\n",ans[r]*inv[ans[l-1]]%mod);
        }
    }
    return 0;
}