#include <bits/stdc++.h>
using namespace std;

typedef int ll;

#define int long long
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define sz(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define endl '\n'
#define fpos adla

typedef pair<int,int>pii;
typedef pair<int,pair<int,int> > piii;

const int mod=1e9+7;

int POWER[65];
int power(int a, int b) {int ret=1;while(b) {if(b&1) ret*=a;a*=a;if(ret>=mod) ret%=mod;if(a>=mod) a%=mod;b>>=1;}return ret;}
int inv(int x) {return power(x,mod-2);}

void precompute() {
	POWER[0]=1;
	for(int i=1;i<63;i++) POWER[i]=POWER[i-1]<<1LL;
}

const int inf = 1e9;
const int maxn = 1e6+55;
char s[maxn];
map<int, int> to[maxn];
int len[maxn], fpos[maxn], link[maxn],leaf[maxn],bkl[maxn];
int node, pos;
string str;
int sz = 1, n = 0;
 
int make_node(int _pos, int _len) {
	//cout<<sz<<" "<<_pos<<" "<<_len<<endl;
    fpos[sz] = _pos;
    len [sz] = _len;
    return sz++;
}
 
void go_edge() {
	// cout<<pos<<" "<<to[node][s[n-pos]]<<" "<<len[to[node][s[n-pos]]]<<endl;
    while(pos > len[to[node][s[n - pos]]]) {
    	// cout<<pos<<" "<<len[to[node][s[n-pos]]]<<endl;
        node = to[node][s[n - pos]];
        pos -= len[node];
    }
}
 
void add_letter(int c) {
    s[n++] = c; 
    pos++;
    int last = 0;
    // cout<<"lol \n";
    while(pos > 0) {
    	// cout<<"zzzzzzz\n";
        go_edge();
        int edge = s[n - pos];
        int &v = to[node][edge];
        int t = s[fpos[v] + pos - 1];
        if(v == 0) {
        	// cout<<"xx "<<node<<" "<<pos<<endl;
            v = make_node(n - pos, inf);
            link[last] = node;
            last = 0;
        }
        else if(t == c) {
        	// cout<<"yy\n";
            link[last] = node;
            return;
        }
        else {
        	// cout<<"zz\n";
            int u = make_node(fpos[v], pos - 1);
            to[u][c] = make_node(n - 1, inf);
            to[u][t] = v;
            fpos[v] += pos - 1;
            len [v] -= pos - 1;
            v = u;
            link[last] = u;
            last = u;
        }
        if(node == 0)
            pos--;
        else
            node = link[node];
    }
}

char pri[maxn];
int currl=0;
vector<pii>vv;
int totsu=0;
pii vv1[maxn],vw[maxn];

void dfs(int curr  , int pre , int _len) {
	int nlen=_len;
	int val=len[curr];
	if(val>n)	val=n-fpos[curr];
	if(curr!=0)	nlen+=val;

	for (char c='a' ; c<='z' ; c++) {
		int px=c;
		if(to[curr].find(px)==to[curr].end())	continue;
		dfs(to[curr][px],curr,nlen);
		leaf[curr]+=leaf[to[curr][px]];
		bkl[curr]=bkl[to[curr][px]];
	}

	char c='$';
	int px=c;
	if(to[curr].find(px)!=to[curr].end()) {
		dfs(to[curr][px],curr,nlen);
		leaf[curr]+=leaf[to[curr][px]];
		bkl[curr]=bkl[to[curr][px]];
	}

	if(sz(to[curr])==0) {
		bkl[curr]=nlen;
		leaf[curr]=1;
	}
	//cout<<curr<<" "<<leaf[curr]<<endl;
}

void dfs2(int curr  , int pre , int _len) {
	// cout<<curr<<" "<<str.substr(fpos[curr],len[curr])<<" "<<fpos[curr]<<" "<<len[curr]<<" "<<pre<<endl;

	int nlen=_len;
	int val=len[curr];
	if(val>n)	val=n-fpos[curr];
	if(curr!=0)	nlen+=val;

	int st=n-bkl[curr];

	if(curr!=0) {
		vw[curr]=mp(st,nlen);
	}
	// cout<<curr<<endl;
	for (char c='a' ; c<='z' ; c++) {
		int px=c;
		if(to[curr].find(px)==to[curr].end())	continue;
		dfs2(to[curr][px],curr,nlen);
	}

	char c='$';
	int px=c;
	if(to[curr].find(px)!=to[curr].end()) {
		dfs2(to[curr][px],curr,nlen);
	}

	//cout<<curr<<" "<<leaf[curr]<<endl;
}

void dfs3(int curr  , int pre , int _len) {
	// cout<<curr<<" "<<str.substr(fpos[curr],len[curr])<<" "<<fpos[curr]<<" "<<len[curr]<<" "<<pre<<endl;

	int nlen=_len;
	int val=len[curr];
	if(val>n)	val=n-fpos[curr];
	if(curr!=0)	nlen+=val;

	int st=n-bkl[curr];
	// cout<<curr<<endl;

	if(sz(to[curr])==0) {
		nlen--;
		val--;
	}
	if(curr!=0) {
		int num=((nlen*(nlen+1))/2)-((_len*(_len+1))/2);
		totsu+=(num*leaf[curr]);
		if(num!=0) {
			vv.pb(mp(totsu,curr));
			vv1[curr]=mp(_len,nlen);
		}
	}
	for (char c='a' ; c<='z' ; c++) {
		int px=c;
		if(to[curr].find(px)==to[curr].end())	continue;
		dfs3(to[curr][px],curr,nlen);
	}

	char c='$';
	int px=c;
	if(to[curr].find(px)!=to[curr].end()) {
		dfs3(to[curr][px],curr,nlen);
	}

	//cout<<curr<<" "<<leaf[curr]<<endl;
}

ll main() {
	// freopen("Task.in","r",stdin);freopen("Task.out","w",stdout);

	std:ios::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	
	
    len[0] = inf;
    cin >> str;
    str+='$';
    int ans = 0;
    for(int i = 0; i < str.size(); i++) {
    	// cout<<str[i]<<endl;
        add_letter(str[i]);	
    }

    dfs(0,-1,0);
    dfs2(0,-1,0);
    dfs3(0,-1,0);

    // for (int i=0 ; i<sz(vv) ; i++)	cout<<vv[i].ss<<" "<<vv[i].ff<<endl;

    // for (int i=0 ; i<sz(vw) ; i++)	cout<<vw[i].ff<<" "<<str.substr(vw[i].ss.ff,vw[i].ss.ss)<<endl;
    // cout<<vv[sz(vv)-1].ff<<endl;
    int q;
	cin>>q;

	int g=0;
	while (q--) {
		int p,m;
		cin>>p>>m;
		p%=m;
		int x=(p*g)%m+1;
		// cout<<g<<" "<<x<<endl;


		int id=lower_bound(all(vv),mp(x,0LL))-vv.begin();
		assert(id<sz(vv));
		int nd=vv[id].ss;
		int lo=vv1[nd].ff+1,hi=vv1[nd].ss;
		int pp=lo-1;
		int mul=leaf[nd],ret=-1;

		int fnd=x;
		if(id!=0)	fnd-=vv[id-1].ff;

		// cout<<x<<" "<<nd<<" "<<lo<<" "<<hi<<endl;

		while (lo<=hi) {
			int mid=(lo+hi)/2;
			int numm=((mid*(mid+1))/2)-((pp*(pp-1))/2);
			numm*=mul;

			if(numm>=fnd) {
				ret=mid;
				hi=mid-1;
			}
			else	lo=mid+1;
		}
		// cout<<fnd<<" "<<ret<<endl;
		int qq=ret-1;
		int numm=((qq*(qq+1))/2)-((pp*(pp+1))/2);
		// cout<<pp<<" "<<qq<<endl;
		numm*=mul;
		fnd-=numm;
		fnd%=ret;
		if(fnd==0)	fnd=ret;
		// cout<<nd<<" "<<str.substr(vw[nd].ff,vw[nd].ss)<<" "<<ret<<" "<<fnd<<endl;
		cout<<str[vw[nd].ff+fnd-1]<<endl;
		g+=(str[vw[nd].ff+fnd-1]);
	}
}