#include <bits/stdc++.h>
#define rep(i, p, n) for (ll i = p; i < (ll)(n); i++)
#define rep2(i, p, n) for(ll i = p; i >= (ll)(n); i-- )
using namespace std;
using ll = long long;
using ld = long double;
double pi=3.141592653589793;
const long long inf=2*1e9;
const long long linf=8*1e18;
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; }

//atcoder
#include <atcoder/modint>
#include <atcoder/dsu>
#include <atcoder/segtree>
#include <atcoder/lazysegtree>
using namespace atcoder;
using mint1 = modint1000000007;
using mint2 = modint998244353;

/*
//多倍長整数
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
using ci = cpp_int;
//ciで定義
//https://boostjp.github.io/tips/multiprec-int.html
//常時使っているとdouble >> llの適切なキャストができない(ll sqrt(整数)等)ので、基本はコメントアウト
*/


//拡張ユークリッド
//input: ll a,b
//output: ax+by=gcd(a,b)の解(x,y)(<max(a, b))
pair<long long, long long> extgcd(long long a, long long b) {
    if (b == 0) return make_pair(1, 0);
    long long x, y;
    tie(y, x) = extgcd(b, a % b);
    y -= a / b * x;
    return make_pair(x, y);
}

//素数列挙
//output: (void)N以下の整数のうち素数であるものをsosuuに返す
void SR(ll N, vector<ll> &sosuu) { 
    vector<bool> testSR(N+1, true);
    for(int i=2; i<=N; i++) {
        if (testSR.at(i)) {
            sosuu.push_back(i);
            for(int j=i*2; j<=N; j+=i) {
                testSR.at(j)=false;
            }
        }
    }
}

ll e() {
    return 0;
}

ll op(ll a, ll b) {
    return a+b;
}

ll mapping(ll f, ll x) {
    if (f==linf) {
        return x;
    }
    return f;
}

ll composition(ll f, ll g) {
    if (f==linf) {
        return g;
    }
    return f;
}

ll id() {
    return linf;
}

int main() {
    ////////////////////
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    ////////////////////

    ll N, A;
    cin >> N >> A;
    vector<pair<ll, ll>> X(N);
    rep(i, 0, N) {
        cin >> X.at(i).first;
        X.at(i).second=i;
    }
    sort(X.begin(), X.end());
    vector<ll> ans(N, -1);
    lazy_segtree<ll, op, e, ll, mapping, composition, id> seg(ans);
    ll T;
    cin >> T;
    rep(i, 0, T) {
    	ll L, R;
    	cin >> L >> R;
    	R++;
    	pair<ll, ll> temp={L, 0};
		ll u=lower_bound(X.begin(), X.end(), temp)-X.begin();
		temp={R, 0};
		ll v=lower_bound(X.begin(), X.end(), temp)-X.begin();
		seg.apply(u, v, i+1);
    }
    vector<ll> G(N);
    rep(i, 0, N) {
        G.at(X.at(i).second)=seg.get(i);
    }
    rep(i, 0, N) {
        cout << G.at(i) << endl;
    }
}