#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <iterator>
#include <string>
#include <string.h>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <sstream>
#include <cstring>
#include <cstdlib>
#include <stdlib.h>
#include <stdio.h>
#include <cstdio>
#include <queue>
#define forn(i,n) for(int i=0;i<n;i++)
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int maxn=100000+10;
const int mod=9973;
int n;
char s[maxn];
int segtree[maxn*4];
void build(int node,int L,int R)
{
    if(L==R)
        segtree[node]=(s[L]-28)%mod;
    else
    {
        int mid=L+(R-L)/2;
        build(2*node,L,mid);
        build(2*node+1,mid+1,R);
        segtree[node]=(segtree[2*node]*segtree[2*node+1])%mod;
    }
}
int query(int node,int L,int R,int ql,int qr)
{
    if(ql<=L && qr>=R)
        return segtree[node];
    else
    {
        int mid=L+(R-L)/2;
        int ans1=1;
        if(ql<=mid)ans1=query(node*2,L,mid,ql,qr);
        int ans2=1;
        if(qr>mid)ans2=query(node*2+1,mid+1,R,ql,qr);
        return (ans1*ans2)%mod;
    }
}

int main()
{
    #ifdef LOCAL
    freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    #endif // LOCAL
    while(scanf("%d%s",&n,s)==2)
    {
        int len=strlen(s);
        build(1,0,len-1);
        while(n--)
        {
            int a,b;
            scanf("%d%d",&a,&b);
            printf("%d\n",query(1,0,len-1,a-1,b-1));
            //printf("%d\n",query(a-1,b-1));
        }
    }
    return 0;
}