import bisect
n,q=map(int,input().split())
s=input()
a=[]
z=-1
for i in range(n):
	if s[i]=='a' or s[i]=='w':
		z=i
		break
e=[1]
for i in range(100):
    e.append(e[-1]+pow(2,i)*5)
for i in range(90):
	b=[0]
	for j in range(n):
		if (s[j]=='a' or s[j]=='w') and i>0:
			b.append(b[-1]+e[i])
		else:
			b.append(b[-1]+1)
	a.append(tuple(b))
def f(t,x,d):
	if d==0:
		if t==1:
			return 'answer'[x]
		if x<e[t-1]:
			return f(t-1,x,0)
		elif x==e[t-1]:
			return 'n'
		elif x==e[t-1]+1:
			return 's'
		elif x<2*e[t-1]+2:
			return f(t-1,x-e[t-1]-2,1)
		elif x==2*e[t-1]+2:
			return 'e'
		else:
			return 'r'
	else:
	    if t==1:
	        return 'warong'[x]
	    if x<e[t-1]:
	        return f(t-1,x,1)
	    elif x<2*e[t-1]:
	        return f(t-1,x-e[t-1],0)
	    else:
	        return 'warong'[x-2*e[t-1]+2]
ans=[]
for i in range(q):
	t,x=map(int,input().split())
	x-=1 
	if t<60:
	    y=bisect.bisect(a[t],x)
	    if s[y-1]=='a':
	        ans.append(f(t,x-a[t][y-1],0))
	    elif s[y-1]=='w':
	        ans.append(f(t,x-a[t][y-1],1))
	    else:
	       ans.append(s[y-1])
	else:
		if x<z:
		    ans.append(s[x])
		else:
			if s[z]=='a':
				ans.append(f(60,x-z,0))
			else:
				ans.append(f(60,x-z,1))
print(''.join(ans))