#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

int op(int x, int y) { return min(x, y); }
int e() { return 1001001001; }

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  VI p(n), p_inv(n);
  rep(i, n) cin >> p[i], p[i]--;
  rep(i, n) p_inv[p[i]] = i;
  fenwick_tree<int> ft(n);
  VI d(n);
  rep(i, n) {
    d[i] = ft.sum(0, p[i]);
    ft.add(p[i], 1);
  }
  segtree<int, op, e> seg(p);
  VI nxt[20];
  nxt[0].resize(n + 1);
  nxt[0][n] = n;
  rrep(i, n) {
    nxt[0][i] = seg.max_right(i + 1, [&](int x) { return x >= p[i]; });
  }
  rep(k, 19) {
    nxt[k+1].resize(n + 1);
    rep(i, n + 1) nxt[k+1][i] = nxt[k][nxt[k][i]];
  }
  int q;
  cin >> q;
  rep(_, q) {
    int x, y;
    cin >> x >> y;
    y--;
    int i = p_inv[y];
    if (x <= d[i]) {
      cout << i + 1 << '\n';
      continue;
    } else {
      int rest = x - d[i];
      int pos = i;
      rrep(k, 20) if (rest >> k & 1) {
        pos = nxt[k][pos];
      }
      cout << pos + 1 << '\n';
    }
  }
}