#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;

#define rep(i,n) for(ll i=0;i<n;++i)
#define all(a) (a).begin(),(a).end()
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
template<class T> T div_floor(T a, T b) { return a / b - ((a ^ b) < 0 && a % b); }
template<class T> T div_ceil(T a, T b) { return a / b + ((a ^ b) > 0 && a % b); }
template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }


void solve() {
    ll N,Q;
    cin>>N>>Q;
    string S;
    cin>>S;
    const ll INF=4e18;
    vector<vector<ll>> turn_len_sum(60,vector<ll> (N+1,0));
    auto lenT=[](ll t)->ll {
        if (t>=60){
            return INF;
        }
        else{
            return (1LL<<t)*5-4;
        }
    };
    rep(d,60){
        rep(i,N){
            if (S[i]=='w' or S[i]=='a'){
                turn_len_sum[d][i+1]=lenT(d);
            }
            else{
                turn_len_sum[d][i+1]=1;
            }
            turn_len_sum[d][i+1]+=turn_len_sum[d][i];
            chmin(turn_len_sum[d][i+1],INF);
        }
    }
    auto wstr=[&](auto wstr,auto astr,ll t,ll i)->char {
        chmin(t,59);
        assert (i<lenT(t));
        if (t==0){
            return 'w';
        }
        if (i<lenT(t-1)){
            return wstr(wstr,astr,t-1,i);
        }
        i-=lenT(t-1);
        if (i<lenT(t-1)){
            return astr(wstr,astr,t-1,i);
        }
        i-=lenT(t-1);
        string rong="rong";
        assert (i<4);
        return rong[i];
    };
    auto astr=[&](auto wstr,auto astr,ll t,ll i)->char {
        chmin(t,59);
        assert (i<lenT(t));
        if (t==0){
            return 'a';
        }
        if (i<lenT(t-1)){
            return astr(wstr,astr,t-1,i);
        }
        i-=lenT(t-1);
        if (i<2){
            string ns="ns";
            return ns[i];
        }
        i-=2;
        if (i<lenT(t-1)){
            return wstr(wstr,astr,t-1,i);
        }
        i-=lenT(t-1);
        string er="er";
        assert (i<2);
        return er[i];
    };
    string ans;
    rep(_,Q){
        ll t,x;
        cin>>t>>x;
        chmin(t,59);
        x--;
        ll ok=0;
        ll ng=N+1;
        while (ng-ok>1){
            ll mid=(ok+ng)/2;
            if (turn_len_sum[t][mid]<=x){
                ok=mid;
            }
            else{
                ng=mid;
            }
        }
        x-=turn_len_sum[t][ok];
        if (S[ok]=='w'){
            ans.push_back(wstr(wstr,astr,t,x));
        }
        else if (S[ok]=='a'){
            ans.push_back(astr(wstr,astr,t,x));
        }
        else{
            ans.push_back(S[ok]);
        }
    }
    cout<<ans<<endl;
    return;
}


int main() {
    ll T=1;
    while (T--){
        solve();
    }
    return 0;
}