#pragma GCC optimize("O3")

#include "bits/stdc++.h"
//import std;

using namespace std;

using ll = long long;
using ull = unsigned long long;
const double eps = 1e-9;

#define OVERLOAD3(_1, _2, _3, call,...) call
#define REP0(n) for (ll i = 0; i < ll(n); ++i)
#define REP1(i, n) for (ll i = 0; i < ll(n); ++i)
#define REP2(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define REP(...) OVERLOAD3(__VA_ARGS__, REP2, REP1, REP0)(__VA_ARGS__)
#define RREP0(n) for (ll i = ll(n) - 1; i >= 0; --i)
#define RREP1(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define RREP2(i, a, b) for (ll i = ll(a) - 1; i >= b; --i)
#define RREP(...) OVERLOAD3(__VA_ARGS__, RREP2, RREP1, RREP0)(__VA_ARGS__)
#define REPE(i, c) for (auto&& i : c)
#define TCASE() ll _ttt; cin >> _ttt; while(_ttt--)

template<class... T> void COMMON_IN(T&... a) { (cin >> ... >> a); }
#define LI(...) ll __VA_ARGS__; COMMON_IN(__VA_ARGS__);
#define SI(...) string __VA_ARGS__; COMMON_IN(__VA_ARGS__);

using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>;
#define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;
#define DLI(a, n) deque<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;
#define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x;
#define VVLI(a, n, m) vector<vector<ll>> a(n, vector<ll>(m)); for(auto& x : a) for(auto& y : x) cin >> y;
using vd = vector<double>; using pl = pair<ll, ll>; using vpl = vector<pl>; using vvpl = vector<vpl>;

struct uv { ll u; ll v; };
struct uvc { ll u; ll v; ll c = 1; };
#define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;}
#define VUVCI(a, n) vector<uvc> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;}
vvl to_edge(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].emplace_back(x.v); return ret; }
vvl to_edge_d(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].emplace_back(x.v); ret[x.v].emplace_back(x.u); } return ret; }
vvpl to_edge_d(const ll n, const vector<uvc>& v) { vvpl ret(n); for (auto& x : v) { ret[x.u].emplace_back(x.v, x.c); ret[x.v].emplace_back(x.u, x.c); } return ret; }

template <class T = long long> using pql = priority_queue<T>;
template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>;

//template <class T> requires std::is_base_of_v<atcoder::internal::modint_base, T> ostream& operator<<(ostream& os, const T& v) { os << v.val(); return os; }
void yn(bool f) { std::cout << (f ? "Yes" : "No") << "\n"; };
template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } };
template<class T> void ovn(const T& v) { ov(v); cout << "\n"; };


const ll llhuge = 1LL << 61; //十分でかいが多少足しても溢れない数値
auto gmax(const auto& a, const auto& b) { return a > b ? a : b; };
auto gmin(const auto& a, const auto& b) { return a < b ? a : b; };
bool chmin(auto& a, const auto& b) { const auto olda = a; a = gmin(a, b); return olda != a; }
bool chmax(auto& a, const auto& b) { const auto olda = a; a = gmax(a, b); return olda != a; }
void sort(auto& v) { std::ranges::sort(v); };
void rev(auto& v) { std::ranges::reverse(v); };
template<class T> auto p_sum(const T& v) { T ret(v.size()); std::partial_sum(begin(v), end(v), ret.begin()); return ret; };
template<class T, class K = T::key_type, class V = T::mapped_type> [[nodiscard]] V myat(const T& mp, const K& key) { return mp.find(key) == mp.end() ? V() : mp.at(key); }
long long ceil(const long long a, const long long b) { return (a + b - 1) / b; }

vl len;
char wt(char c, ll stp, ll ix) {
	if (c != 'w' && c != 'a') return c;
	if (stp == 0) return c;

	string s = c == 'w' ? "warong" : "answer";
	REP(i, 6) {
		ll sz =  (s[i] == 'w' || s[i] == 'a')? len[stp - 1]: 1;

		if (ix < sz) {
			return wt(s[i], stp - 1, ix);
		}
		else {
			ix -= sz;
		}
	}
}

//二分探索でf(t)を満たす整数tを返す
//ng < ok ならtは最小値 ng > ok ならtは最大値
template <class F>
ll bs(ll ok, ll ng, F f) {
	while (abs(ok - ng) > 1) {
		ll mid = ok + (ng - ok) / 2;

		if (f(mid)) ok = mid;
		else ng = mid;
	}
	return ok;
}

int main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	{
		ll t = 1;
		len.resize(60);
		REP(i, 60) {
			len[i] = (t - 1) * 5 + 1;
			t *= 2;
		}
	}

	LI(n, q);
	SI(s);
	vl wac(n+1, 0);
	REP(i, n) {
		wac[i + 1] = wac[i];
		if (s[i] == 'w' || s[i] == 'a') wac[i + 1]++;
	}

	REP(i, q) {
		LI(t, x);
		x--;

		t = min(t, 59LL);

		ll ix = bs(0, n+1, [&](ll m) {
			if (m - wac[m] > x) return false;
			ll rem = x - (m - wac[m]);
			ll lent = len[t];
			ll qt = rem / lent;

			return wac[m] <= qt;
		});

		cout << wt(s[ix], t, x - (wac[ix] * len[t] + (ix - wac[ix])));

	}

}