from builtins import len
import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################

"""
w
wa----


a
a--w--
a--w--|--|wa----|--



m回目の置換後で a が長さ f(m)
f(0) = 1
f(1) = 6
f(2) = 6 + 5 * 2 = 16
f(3) = 16 + 5 * 4 = 36
f(m) = f(m-1) + 5 * 2^(m-1) = 5 * (2^m - 1) + 1

"""

n, q = na()
s = input()

m = 60
query = [[] for i in range(m)]
big_queries = []
for i in range(q):
    t, x = na()
    x -= 1
    if t < m:
        query[t].append((i, x))
    else:
        big_queries.append((i, t, x))
    
from functools import lru_cache
@lru_cache(None)
def solve_a(x, t):
    if t == 0:
        return 'a'
    t = min(t, m)
    if x < f[t-1]:
        return solve_a(x, t-1)
    x -= f[t-1]
    if x < 1:
        return "n"
    x -= 1
    if x < 1:
        return "s"
    x -= 1
    if x < f[t-1]:
        return solve_w(x, t-1)
    x -= f[t-1]
    if x < 1:
        return "e"
    x -= 1
    if x < 1:
        return "r"

@lru_cache(None)
def solve_w(x, t):
    if t == 0:
        return 'w'
    t = min(t, m)
    if x < f[t-1]:
        return solve_w(x, t-1)
    x -= f[t-1]
    if x < f[t-1]:
        return solve_a(x, t-1)
    x -= f[t-1]
    if x < 1:
        return "r"
    x -= 1
    if x < 1:
        return "o"
    x -= 1
    if x < 1:
        return "n"
    x -= 1
    if x < 1:
        return "g"
    
f = [0] * m
f[0] = 1
for i in range(1, m):
    f[i] = f[i-1] + 5 * (1 << (i-1))

ans = [0] * q
for t in range(m):
    if len(query[t]) == 0:
        continue
    rui = [0] * (len(s) + 1)
    for i in range(len(s)):
        rui[i+1] = rui[i] + (f[t] if (s[i] == 'a' or s[i] == 'w') else 1)
    
    query[t].sort(key=lambda x: x[1])
    j = 0
    for i, x in query[t]:
        while j < len(s) and rui[j+1] <= x:
            j += 1
        if s[j] == "a":
            ans[i] = solve_a(x - rui[j], t)
        elif s[j] == "w":
            ans[i] = solve_w(x - rui[j], t)
        else:
            ans[i] = s[j]
big_queries.sort(key=lambda x: x[2])
j = 0
rui = [0] * (len(s) + 1)
for i in range(len(s)):
    rui[i+1] = rui[i] + (10 ** 18 + 10 if (s[i] == 'a' or s[i] == 'w') else 1)

for i, t, x in big_queries:
    while j < len(s) and rui[j+1] <= x:
        j += 1
    if s[j] == "a":
        ans[i] = solve_a(x - rui[j], t)
    elif s[j] == "w":
        ans[i] = solve_w(x - rui[j], t)
    else:
        ans[i] = s[j]

print("".join(map(str, ans)))