#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
//#define int long long
const ll mod=1e9+7;
const int mxsz=5e2;
const ll inf = LLONG_MAX;
int main(){
int n,q;
cin>>n>>q;
vector<int>a(n);
for (int i=0;i<n;i++){
cin>>a[i];
}
int t,ind;
cin>>t>>ind;
vector<int>c=a;
while (t--){
deque<int>cur1,cur2;
vector<int>tmp;
for (int i=0;i<n/2;i++){
cur1.pb(c[i]);
}
for (int i=n/2;i<n;i++){
cur2.pb(c[i]);
}
while (!cur1.empty() && !cur2.empty()){
if (cur1.front()<cur2.front()){
tmp.pb(cur1.front());
cur1.pop_front();
}else{
tmp.pb(cur2.front());
cur2.pop_front();
}
}
if (!cur1.empty()){
for (auto x:cur1)tmp.pb(x);
}
if (!cur2.empty()){
for (auto x:cur2)tmp.pb(x);
}
c=tmp;
}
cout<<c[--ind]<<endl;
while (q--){
cin>>t>>ind;
cout<<c[--ind]<<endl;
}
return 0;
}
