#include<bits/stdc++.h>
using namespace std;

int main(){
  using ll=long long;
  int n,q;
  string s;
  cin>>n>>q>>s;
  int top=-1;
  for (int i=0;i<n;i++){
    if (s[i]=='w'||s[i]=='a'){
      top=i;
      break;
    }
  }
  vector<pair<ll,ll>> tx(q);
  vector<vector<pair<ll,ll>>> vec(62);
  for (int i=0;i<q;i++){
    ll t,x;
    cin>>t>>x;
    tx[i]={t,x};
    if (t<60) vec[t].push_back({x,i});
  }
  auto f=[&](char c,int t){
    ll len=1;
    if (c=='w'||c=='a') len=(1LL<<t)+(1LL<<(t+2))-4;
    return len;
  };
  vector<int> pre(q,-1);
  for (int k=1;k<60;k++){
    sort(vec[k].begin(),vec[k].end());
    int j=0;
    ll sum=0;
    for (int i=0;i<n;i++){
      ll prev=sum;
      sum+=f(s[i],k);
      while (j<vec[k].size()&&sum>=vec[k][j].first){
        pre[vec[k][j].second]=i;
        tx[vec[k][j].second].second-=prev;
        j++;
      }
    }
  }
  for (int k=0;k<q;k++){
    auto [t,x]=tx[k];
    string now;
    if (t<60){
      now+=s[pre[k]];
    }
    else{
      now+=s[top];
      x-=top;
      t=60;
    }
    while (t){
      for (char c:now){
        ll len=f(c,t);
        if (x>len) x-=len;
        else{
          string next;
          next+=c;
          if (c=='w') next="warong";
          if (c=='a') next="answer";
          swap(now,next);
          break;
        }
      }
      t--;
    }
    cout<<now[x-1];
  }
  cout<<endl;
}