#include <bits/stdc++.h> using namespace std; #define print(l) for(auto i:l) cout<<i<<" ";cout<<endl; #define input(t,l,n) vector<t>l(n);for(int i = 0;i<n;i++)cin>>l[i]; #define int long long #define pb push_back #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> #define all(l) l.begin(),l.end() #define pii pair<int,int> #define fi first #define se second const int M = 1e9+7; const int inf = 1e18; int bp(int x, int y, int p){ int res = 1; x = x % p; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } int MI(int n, int p){ return bp(n, p - 2, p); } int mul(int x,int y, int p){ return x * 1ull * y % p; } int di(int x,int y, int p){ return mul(x, MI(y, p), p); } int n , m , k , q; void solve(int testcase_number){ int q; cin>>n>>q; input(int,l,n); int f = 1; vector<vector<int>>ord; for(int i = 0;i<q;i++){ int t,idx; cin>>t>>idx; ord.pb({t,idx,i}); } int op =0; vector<int>ans(n,0); sort(all(ord)); for(auto i:ord){ while(f and op < i[0]){ vector<int>k,top,bot; int p1 =0; int p2 = n/2; while(p1<n/2 and p2<n){ k.pb(min(l[p1],l[p2])); if(k.back() == l[p1]){p1++;} else p2++; } while(p1<n/2) {k.pb(l[p1]);p1++;} while(p2<n) {k.pb(l[p2]);p2++;} if(l == k){ f = 0; //print(l); break; } l = k; op++; //T--; } ans[i[2]] = l[i[1]-1]; } for(auto i:ans){ cout<<i<<endl; } //print(l); } signed main(){ ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE cin.tie(0), cout.tie(0); cout << fixed<<setprecision(9); int t = 1; //cin>>t; for(int i = 1;i<=t;i++){ solve(i); } }