#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define debug 0
#define YES cout << "Yes" << endl;
#define NO cout << "No" << endl;
using ll = long long;
using ld = long double;
const int mod = 998244353;
const int MOD = 1000000007;
const double pi = atan2(0, -1);
#include <time.h>
#include <chrono>

struct SegTree {
	int n = 1;
	vector<int> tree;
	SegTree(int N) {
		while (n < N) {
			n *= 2;
		}
		vector<int> v(n * 2, -1);
		swap(v, tree);
	}

	void Update(int l, int r, int t, int b, int u, int now) {
		if (r <= b || l>=u) {
			return;
		}
		else if (l <= b && r >= u) {
			tree[now] = t;
			return;
		}
		else {
			Update(l, r, t, b, (b + u) / 2, now * 2 + 1);
			Update(l, r, t, (b + u) / 2, u, now * 2 + 2);
		}
	}

	void Query(int L, int R, int t) {
		Update(L, R + 1, t, 0, n, 0);
	}

	int Calc(int now, int x) {
		if (now == 0) {
			return x;
		}
		else {
			return Calc((now - 1) / 2, max(x, tree[now]));
		}
	}

	int Ans(int i) {
		return Calc(n - 1 + i, -1);
	}
};

int main() {
	int N, A;
	cin >> N >> A;
	vector<int> X(N);
	rep(i, N) {
		cin >> X[i];
	}
	int T;
	cin >> T;
	vector<vector<int>> query(T, vector<int>(2));
	rep(i, T) {
		cin >> query[i][0] >> query[i][1];
	}

	set<int> s;
	rep(i, N) {
		s.insert(X[i]);
	}
	rep(i, T) {
		s.insert(query[i][0]);
		s.insert(query[i][1]);
	}

	vector<int> x(N);
	vector<vector<int>> q(T, vector<int>(2));
	map<int, int> mp;
	int c = 0;
	for (int t : s) {
		mp[t] = c;
		c++;
	}

	rep(i, N) {
		x[i] = mp[X[i]];
	}
	rep(i, T) {
		q[i] = { mp[query[i][0]], mp[query[i][1]] };
	}

	SegTree st(c);
	rep(i, T) {
		st.Query(q[i][0], q[i][1], i + 1);
	}
	rep(i, N) {
		cout << st.Ans(x[i]) << endl;
	}
}