#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using VS = vector<string>;
using P = pair<ll,ll>;
using VP = vector<P>;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define out(x) cout << x << endl
#define dout(x) cout << fixed << setprecision(10) << x << endl
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define sz(x) (int)(x.size())
#define re0 return 0
#define pcnt __builtin_popcountll
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
constexpr int inf = 1e9;
constexpr ll INF = 1e18;
//using mint = modint1000000007;
//using mint = modint998244353;
int di[4] = {1,0,-1,0};
int dj[4] = {0,1,0,-1};

// Coodinate Compression
// https://youtu.be/fR3W5IcBGLQ?t=8550
template<typename T=int>
struct CC {
  bool initialized;
  vector<T> xs;
  CC(): initialized(false) {}
  void add(T x) { xs.push_back(x);}
  void init() {
    sort(xs.begin(), xs.end());
    xs.erase(unique(xs.begin(),xs.end()),xs.end());
    initialized = true;
  }
  int operator()(T x) {
    if (!initialized) init();
    return upper_bound(xs.begin(), xs.end(), x) - xs.begin() - 1;
  }
  T operator[](int i) {
    if (!initialized) init();
    return xs[i];
  }
  int size() {
    if (!initialized) init();
    return xs.size();
  }
};

void solve(){
    ll n,a;
    cin >> n >> a;
    CC cc;
    VL x(n);
    rep(i,n){
        cin >> x[i];
        cc.add(x[i]);
    }
    ll t;
    cin >> t;
    VL l(t),r(t);
    rep(i,t){
        cin >> l[i] >> r[i];
        cc.add(l[i]);
        cc.add(r[i]);
    }
    cc.init();
    map<ll,ll> mp;
    rep(i,n){
        mp[cc(x[i])] = i;
        x[i] = cc(x[i]);
    }
    rep(i,t){
        l[i] = cc(l[i]);
        r[i] = cc(r[i]);
    }
    ll m = sz(cc.xs);
    set<ll> st;
    rep(i,m+1) st.insert(i);
    VL ans(n,-1);
    for(ll i = t-1;i >= 0;i--){
        ll now = l[i];
        while(now <= r[i]){
            if(mp.count(now)){
                ans[mp[now]] = i+1;
            }
            st.erase(now);
            now++;
            if(st.count(now)) continue;
            else {
                auto itr = st.lower_bound(now);
                now = *itr;
            }
        }
    }
    rep(i,n) out(ans[i]);
}

int main(){
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int t = 1;
    rep(ti,t) solve();
}