import sys # sys.setrecursionlimit(200005) # sys.set_int_max_str_digits(200005) int1 = lambda x: int(x)-1 pDB = lambda *x: print(*x, end="\n", file=sys.stderr) p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr) def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] # dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] inf = -1-(-1 << 31) # inf = -1-(-1 << 62) # md = 10**9+7 md = 998244353 size = [1] while size[-1] < 10**18: size.append(size[-1]*2+4) # print(len(size)) n, q = LI() s = SI() csa = [0] csw = [0] csx = [0] for c in s: csa.append(csa[-1]) csw.append(csw[-1]) csx.append(csx[-1]) if c == "a": csa[-1] += 1 elif c == "w": csw[-1] += 1 else: csx[-1] += 1 def binary_search(l, r, minimize): if minimize: l -= 1 else: r += 1 while l+1 < r: m = (l+r)//2 if ok(m) ^ minimize: l = m else: r = m if minimize: return r return l def ok(m): return (csa[m]+csw[m])*size[t]+csx[m] <= x def fa(lv, i): if lv == 0: return "a" if i < size[lv-1]: return fa(lv-1, i) i -= size[lv-1] if i < 2: return "ns"[i] i -= 2 if i < size[lv-1]: return fw(lv-1, i) i -= size[lv-1] return "er"[i] def fw(lv, i): if lv == 0: return "w" if i < size[lv-1]: return fw(lv-1, i) i -= size[lv-1] if i < size[lv-1]: return fa(lv-1, i) i -= size[lv-1] return "rong"[i] ans = [] for qi in range(q): t, x = LI() t = min(t, 58) x -= 1 i = binary_search(0, n, False) if s[i] == "a": x-=(csa[i]+csw[i])*size[t]+csx[i] ans.append(fa(t, x)) elif s[i] == "w": x-=(csa[i]+csw[i])*size[t]+csx[i] ans.append(fw(t, x)) else: ans.append(s[i]) print(*ans,sep="")