#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <array>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <utility>
#include <random>
#include <cassert>
#include <fstream>
using namespace std;
mt19937 rnd(time(nullptr));
/* -------------------- Typedefs -------------------- */
typedef int itn;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef float fl;
typedef long double ld;
/* -------------------- Usings -------------------- */
using vi = vector<int>;
using vll = vector<ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
/* -------------------- Defines -------------------- */
#define ff first
#define ss second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mpr make_pair
#define yes cout<<"Yes\n"
#define no cout<<"No\n"
#define all(x) (x).begin(), (x).end()
#define USACO freopen("feast.in", "r", stdin); freopen("feast.out", "w", stdout);
/* -------------------- Constants -------------------- */
const int dx[8] = { -1, 0, 1, 0, -1, -1, 1, 1 };
const int dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };
const int MAX = int(1e9 + 5);
const ll MAXL = ll(1e18) + 5ll;
const ll MOD = ll(1000000007);
const ll MOD2 = ll(998244353);
/* -------------------- Functions -------------------- */
void fastio() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
void precision(int x) {
cout.setf(ios::fixed | ios::showpoint);
cout.precision(x);
}
ll gcd(ll a, ll b) {
if (a == 0 || b == 0) return(max(a, b));
while (b) {
a %= b;
swap(a, b);
}
return a;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
ll range_sum(ll a, ll b) {
if (a > b) return 0ll;
ll dif = a - 1, cnt = b - a + 1;
ll ans = ((b - a + 1) * (b - a + 2)) / 2;
ans += ((b - a + 1) * dif);
return ans;
}
string dec_to_bin(ll a) {
string s = "";
for (ll i = a; i > 0; ) {
ll k = i % 2;
i /= 2;
char c = k + 48;
s += c;
}
if (a == 0) {
s = "0";
}
reverse(all(s));
return s;
}
ll bin_to_dec(string s) {
ll num = 0;
for (int i = 0; i < s.size(); i++) {
num *= 2ll;
num += (s[i] - '0');
}
return num;
}
ll factorial_by_mod(ll n, ll mod) {
ll ans = 1;
ll num;
for (ll i = 1; i <= n; ++i) {
num = i % mod;
ans *= num;
ans %= mod;
}
return ans;
}
bool isPrime(ll a) {
if (a == 1) return false;
for (ll i = 2; i * i <= a; i++) {
if (a % i == 0) return false;
}
return true;
}
ll binpow(ll a, ll b) {
if (!a) return 0;
ll ans = 1;
while (b) {
if (b & 1) {
ans *= a;
}
b >>= 1;
a *= a;
}
return ans;
}
ll binpow_by_mod(ll a, ll b, ll mod) {
if (!a) return 0;
ll ans = 1;
while (b) {
if (b & 1) {
ans *= a;
ans %= mod;
}
b >>= 1;
a *= a;
a %= mod;
}
return ans;
}
/* -------------------- Solution -------------------- */
const int N = 200005;
int a[N], id[N], sz[N], par[N], ans[N];
int t[N * 4];
pii ran[N];
vector<pii> harc[N];
int n, q, m;
void bld(int l = 1, int r = n, int pos = 1) {
if (l == r) {
par[l] = pos;
t[pos] = sz[l];
return;
}
int mid = (l + r) / 2;
bld(l, mid, 2 * pos);
bld(mid + 1, r, 2 * pos + 1);
t[pos] = t[2 * pos] + t[2 * pos + 1];
}
int qry(int l, int r, int tl = 1, int tr = n, int pos = 1) {
if (l == tl && r == tr) {
return t[pos];
}
int mid = (tl + tr) / 2;
if (mid >= r) {
return qry(l, r, tl, mid, 2 * pos);
}
if (mid < l) {
return qry(l, r, mid + 1, tr, 2 * pos + 1);
}
return qry(l, mid, tl, mid, 2 * pos) + qry(mid + 1, r, mid + 1, tr, 2 * pos + 1);
}
void upd(int pos, int val) {
pos = par[pos];
t[pos] = val;
pos /= 2;
while (pos) {
t[pos] = t[2 * pos] + t[2 * pos + 1];
pos /= 2;
}
}
void slv() {
cin >> n >> q;
m = n / 2;
int ind = 1;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
id[a[i]] = i;
if (a[i] > a[ind] || i == m + 1 || i == 1) {
ind = i;
ran[a[ind]] = { ind,ind };
}
++sz[a[ind]];
ran[a[ind]].ss = ind + sz[a[ind]] - 1;
}
bld();
for (int i = 1; i <= q; ++i) {
int t, ind;
cin >> t >> ind;
if (t == 0) {
ans[i] = a[ind];
}
harc[min(t, n)].pub({ ind,i });
}
for (int qq = 1; qq <= n; ++qq) {
int l = 1, r = n, mid = 0, len = 0, num = 0;
while (l <= r) {
mid = (l + r) / 2;
int resp = qry(1, mid);
if (resp >= m) {
len = resp;
num = mid;
r = mid - 1;
}
else {
l = mid + 1;
}
}
for (auto elem : harc[qq]) {
int ind = elem.ff;
l = 1, r = n, mid;
int root = -1, length = 0;
while (l <= r) {
mid = (l + r) / 2;
int resp = qry(1, mid);
if (resp >= ind) {
root = mid;
length = resp;
r = mid - 1;
}
else {
l = mid + 1;
}
}
ans[elem.ss] = a[ran[root].ss - (length - ind)];
}
if (len == m) continue;
int half1 = m - (len - sz[num]), half2 = len - m;
sz[num] = half1;
ran[num].ss = ran[num].ff + half1 - 1;
int ind = ran[num].ss + 1;
sz[a[ind]] = half2;
ran[a[ind]] = { ind, ind + half2 - 1 };
upd(num, sz[num]);
upd(a[ind], sz[a[ind]]);
}
for (int i = 1; i <= q; ++i) {
cout << ans[i] << '\n';
}
}
void cs() {
int tstc = 1;
//cin >> tstc;
while (tstc--) {
slv();
}
}
void precalc() {
return;
}
int main() {
fastio();
precalc();
//precision(0);
cs();
return 0;
}
