#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 x + y; }
int e() { return 0; }

} 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;
  segtree<int, op, e> seg(n);
  int q;
  cin >> q;
  vector<vector<P>> qs(n);
  rep(i, q) {
    int x, y;
    cin >> x >> y;
    y--;
    qs[y].emplace_back(i, x);
  }
  VI ans(q);
  rep(i, n) {
    int pos = p_inv[i];
    for(auto [iq, x]: qs[i]) {
      int c0 = seg.prod(0, pos);
      if (x <= c0) {
        ans[iq] = pos;
        continue;
      }
      x -= c0;
      ans[iq] = seg.max_right(pos, [&](int t) { return t < x; });
    }
    seg.set(pos, 1);
  }
  rep(i, q) cout << ans[i] + 1 << '\n';
}