/**************************************************************
    User: error408
    Language: C/C++
    School: SSDUT
    Saying: Do one thing at a time,and do well.
****************************************************************/
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <cstdio>
#include <string>
#include <cstring>
#include <cmath>
#include <ctime>
using namespace std;

#define clr(s,x) memset((s),(x),sizeof(s))
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define lowbit(x) (x&(-x))
#define PB push_back
#define For(i,a,b) for(int i=a;i<b;i++)
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define RL(N) scanf("%I64d",&N)
#define RLL(L,R) (RL(L),RL(R))

typedef long long               LL;
typedef unsigned int            uint;
typedef unsigned long long      ULL;
typedef vector<int>             vint;
typedef vector<string>          vstring;

/************************************END DEFINE*********************************************/

const int maxn = 1e5 + 100;
const int mod  = 9973;

int pow_mod(int x,int y){
    int sum=1;
    while(y){
        if(y&1)sum=(sum*x)%mod;
        x=(x*x)%mod;
        y>>=1;
    }
    return sum;
}

char s[maxn];
int num[maxn];
int main()
{
    int n;
    while(cin>>n){
        scanf("%s",s);
        int len = strlen(s);
        num[0] = 1;
        for(int i=0;i<len;i++){
            num[i+1] = (num[i]*(s[i]-28))%mod;
        }
        while(n--){
            int l,r;
            scanf("%d%d",&l,&r);
            printf("%d\n",num[r]*pow_mod(num[l-1],mod-2)%mod);
        }
    }
    return 0;
}