#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
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 main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, a;
  cin >> n >> a;
  VI x(n);
  rep(i, n) cin >> x[i];
  struct S {
    int i, l, r;
  };
  int t;
  cin >> t;
  vector<S> d(t);
  rep(i, t) {
    int l, r;
    cin >> l >> r;
    d[i] = {i, l, r};
  }
  ranges::sort(d, {}, &S::l);
  vector<int> ord(n);
  iota(ord.begin(), ord.end(), 0);
  sort(ord.begin(), ord.end(), [&](int i, int j) {
    return x[i] < x[j];
  });
  priority_queue<P> q;
  q.emplace(-2, a + 1);
  int ptr = 0;
  VI ans(n);
  for (int i : ord) {
    while (ptr < t && d[ptr].l <= x[i]) {
      q.emplace(d[ptr].i, d[ptr].r);
      ptr++;
    }
    while (q.top().second < x[i]) q.pop();
    ans[i] = q.top().first;
  }
  rep(i, n) cout << ans[i] + 1 << '\n';
}