#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint998244353;
//const int mod = 998244353;
//using mint = modint1000000007;
//const int mod = 1000000007;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
// 区間変更・区間最大値取得
using S = long long;
using F = long long;
const S INF = 8e18;
const F ID = 8e18;
S op(S a, S b) { return std::max(a, b); }
S e() { return -INF; }
S mapping(F f, S x) { return (f == ID ? x : f); }
F composition(F f, F g) { return (f == ID ? g : f); }
F id() { return ID; }
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, a; cin >> n >> a;
	vector<int>x(n);
	rep(i, n)cin >> x[i];

	auto tmp = x;
	std::sort(tmp.begin(), tmp.end());
	tmp.erase(unique(tmp.begin(), tmp.end()), tmp.end());

	vector<long long>init(tmp.size(), -1);
	lazy_segtree<S, op, e, F, mapping, composition, id> seg(init);
	int t; cin >> t;
	rep(i, t) {
		int l, r; cin >> l >> r;
		l = lower_bound(all(tmp), l) - tmp.begin();
		r = upper_bound(all(tmp), r) - tmp.begin();
		seg.apply(l, r, i + 1);
	}
	rep(i, n) {
		int idx = lower_bound(all(tmp), x[i]) - tmp.begin();
		cout << seg.get(idx) << endl;
	}
	return 0;
}