#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, M = 1000005;
int a[N], dp[N], ans[M], par[N], id[N], t[N * 4], sz[N], index[N];
int n, m, q;
void bld(int l = 1, int r = n, int pos = 1) {
if (l == r) {
t[pos] = sz[l];
par[l] = pos;
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 query(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 query(l, r, tl, mid, 2 * pos);
}
if (mid < l) {
return query(l, r, mid + 1, tr, 2 * pos + 1);
}
return query(l, mid, tl, mid, 2 * pos) + query(mid + 1, r, mid + 1, tr, 2 * pos + 1);
}
void upd(int pos, int val) {
sz[pos] = 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;
vector<pair<pii,int>> qry(q);
m = n / 2;
set<int> st;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
index[a[i]] = i;
}
for (int i = m; i >= 1; --i) {
int ind = i + 1;
while (ind <= m) {
if (a[ind] > a[i]) break;
ind = dp[ind];
}
dp[i] = ind;
}
for (int i = n; i > m; --i) {
int ind = i + 1;
while (ind <= n) {
if (a[ind] > a[i]) break;
ind = dp[ind];
}
dp[i] = ind;
}
for (int i = 0; i < q; ++i) {
cin >> qry[i].ff.ff >> qry[i].ff.ss;
qry[i].ff.ff = min(qry[i].ff.ff, n);
qry[i].ss = i;
}
sort(all(qry));
int qry_ind = 0;
while (qry_ind < q && qry[qry_ind].ff.ff == 0) {
ans[qry[qry_ind].ss] = a[qry[qry_ind].ff.ss];
++qry_ind;
}
for (int i = 1; i <= m; ) {
st.insert(a[i]);
sz[a[i]] = dp[i] - i;
i = dp[i];
}
for (int i = m + 1; i <= n; ) {
st.insert(a[i]);
sz[a[i]] = dp[i] - i;
i = dp[i];
}
bld();
int len = n;
for (int i = 1; i <= n; ++i) {
if (qry_ind == q) break ;
while (len - sz[*st.rbegin()] >= m) {
int num = *st.rbegin();
for (int i = index[num] + sz[num] - 1; i >= index[num]; --i) {
id[len] = a[i];
--len;
}
st.erase(num);
upd(num, 0);
sz[num] = 0;
}
if (len == m) {
while (!st.empty()) {
int num = *st.rbegin();
for (int i = index[num] + sz[num] - 1; i >= index[num]; --i) {
id[len] = a[i];
--len;
}
st.erase(num);
}
while (qry_ind < q) {
ans[qry[qry_ind].ss] = id[qry[qry_ind].ff.ss];
++qry_ind;
}
break;
}
while (qry_ind < q && qry[qry_ind].ff.ff == i) {
if (id[qry[qry_ind].ff.ss]) {
ans[qry[qry_ind].ss] = id[qry[qry_ind].ff.ss];
++qry_ind;
continue;
}
int l = 1, r = n, mid;
int find_ind = qry[qry_ind].ff.ss;
int final_len = 0;
int num = -1;
while (l <= r) {
mid = (l + r) / 2;
int qqq = query(1, mid);
if (qqq < find_ind) {
l = mid + 1;
}
else {
final_len = qqq;
num = mid;
r = mid - 1;
}
}
ans[qry[qry_ind].ss] = a[index[num] + sz[num] - 1 - (final_len - find_ind)];
++qry_ind;
}
int num = *st.rbegin();
int szx = sz[num];
int dist = m + 1 - (len - sz[num] + 1);
upd(num, dist);
sz[num] = dist;
for (int i = index[num] + dist; i <= index[num] + szx - 1; ) {
st.insert(a[i]);
sz[a[i]] = dp[i] - i;
upd(a[i], sz[a[i]]);
i = dp[i];
}
}
for (int i = 0; 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;
}
