from bisect import bisect_left as bl
from bisect import bisect_right as br
N, A = map(int, input().split())
X = list(map(int, input().split()))

N0 = 2**(N-1).bit_length()
data = [None]*(2*N0)
INF = (-1, 2**31-1)
# 区間[l, r+1)の値をvに書き換える
# vは(t, value)という値にする (新しい値ほどtは大きくなる)
def update(l, r, v):
    L = l + N0; R = r + N0
    while L < R:
        if R & 1:
            R -= 1
            data[R-1] = v
 
        if L & 1:
            data[L-1] = v
            L += 1
        L >>= 1; R >>= 1
# a_iの現在の値を取得
def _query(k):
    k += N0-1
    s = INF
    while k >= 0:
        if data[k]:
            s = max(s, data[k])
        k = (k - 1) // 2
    return s
# これを呼び出す
def query(k):
    ans = _query(k)[1]
    return -1 if ans == 2147483647 else ans


for i in range(int(input())):
	L, R = map(int, input().split())
	update(bl(X, L), br(X, R), (i, i + 1))
for i in range(N):
	print(query(i))