/* -*- coding: utf-8 -*-
 *
 * 2650.cc:  No.2650 [Cherry 6th Tune *] セイジャク - yukicoder
 */

#include<cstdio>
#include<vector>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_N = 100000;

/* typedef */

template <typename T>
struct SegTreeMaxDelay {
  int e2;
  vector<T> nodes;
  T defv;
  vector<bool> dls;
  SegTreeMaxDelay() {}

  void init(int n, T _defv) {
    defv = _defv;
    for (e2 = 1; e2 < n; e2 <<= 1);
    nodes.assign(e2 * 2, defv);
    dls.assign(e2 * 2, false);
  }

  T &geti(int i) { return nodes[e2 - 1 + i]; }
  void seti(int i, T v) { geti(i) = v; }

  void setall() {
    for (int j = e2 - 2; j >= 0; j--)
      nodes[j] = max(nodes[j * 2 + 1], nodes[j * 2 + 2]);
  }

  void __update(int k) {
    if (dls[k]) {
      int k0 = k * 2 + 1, k1 = k0 + 1;
      nodes[k0] = nodes[k1] = nodes[k];
      dls[k0] = dls[k1] = true;
      dls[k] = false;
    }
  }

  void set_range(int r0, int r1, T v, int k, int i0, int i1) {
    if (r1 <= i0 || i1 <= r0) return;
    if (r0 <= i0 && i1 <= r1) {
      nodes[k] = v;
      dls[k] = true;
      return;
    }

    __update(k);

    int im = (i0 + i1) / 2;
    int k0 = k * 2 + 1, k1 = k0 + 1;
    set_range(r0, r1, v, k0, i0, im);
    set_range(r0, r1, v, k1, im, i1);
    nodes[k] = max(nodes[k0], nodes[k1]);
  }
  void set_range(int r0, int r1, T v) { set_range(r0, r1, v, 0, 0, e2); }

  T max_range(int r0, int r1, int k, int i0, int i1) {
    if (r1 <= i0 || i1 <= r0) return defv;
    if (r0 <= i0 && i1 <= r1) return nodes[k];

    __update(k);

    int im = (i0 + i1) / 2;
    T v0 = max_range(r0, r1, k * 2 + 1, i0, im);
    T v1 = max_range(r0, r1, k * 2 + 2, im, i1);
    return max(v0, v1);
  }
  T max_range(int r0, int r1) { return max_range(r0, r1, 0, 0, e2); }
};


/* global variables */

int xs[MAX_N], uxs[MAX_N];
SegTreeMaxDelay<int> st;

/* subroutines */

/* main */

int main() {
  int n, a;
  scanf("%d%d", &n, &a);
  for (int i = 0; i < n; i++) scanf("%d", xs + i);

  copy(xs, xs + n, uxs);
  sort(uxs, uxs + n);
  int m = unique(uxs, uxs + n) - uxs;

  st.init(m, -1);

  int tn;
  scanf("%d", &tn);

  for (int t = 0; t < tn; t++) {
    int l, r;
    scanf("%d%d", &l, &r), r++;

    int li = lower_bound(uxs, uxs + m, l) - uxs;
    int ri = lower_bound(uxs, uxs + m, r) - uxs;

    st.set_range(li, ri, t);
  }

  for (int i = 0; i < n; i++) {
    int xi = lower_bound(uxs, uxs + m, xs[i]) - uxs;
    auto e = st.max_range(xi, xi + 1);

    printf("%d\n", (e >= 0) ? e + 1 : -1);
  }

  return 0;
}