#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <cmath>
#include <queue>
#include <set>
#include <map>
using namespace std;
#define ll long long
#define FOR(i,j,k) for(int i =j; i<=k ;i++)
#define ll long long
#define pii pair<int,int>
const int maxn = 1000010;
const ll mod = 9973;
char s[100010];
ll a[100010];
ll fastmod(ll a, ll b)
{
    ll ans =1;
    while(b)
    {
        if(b %2 == 1)
            ans =(ans* a)% mod;
        a =(a* a)% mod;
        b /=2;
    }
    return ans;
}
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        scanf("%s",s);
        int len = strlen(s);
        
        a[0] = 1;
        FOR(i,1,len)
        {
            a[i] =( a[i-1] * (s[i-1]- 28))% mod;
        }
        //cout<<a[1]<<endl;
        FOR(i, 1 ,n){
            int x,y;
            scanf("%d%d",&x,&y);
        
            cout<<(a[y] *  fastmod(a[x-1], mod-2))% mod<<endl;
        }
    }
    return 0;
}