# Xは入力時に昇順なのか?

# 遅延セグメントツリーのrange update queryバージョン
# https://qiita.com/ether2420/items/7b67b2b35ad5f441d686
 
def segfunc(x,y):
    return max(x, y)
class LazySegTree_RUQ:
    def __init__(self,init_val,segfunc,ide_ele):
        n = len(init_val)
        self.segfunc = segfunc
        self.ide_ele = ide_ele
        self.num = 1<<(n-1).bit_length()
        self.tree = [ide_ele]*2*self.num
        self.lazy = [None]*2*self.num
        for i in range(n):
            self.tree[self.num+i] = init_val[i]
        for i in range(self.num-1,0,-1):
            self.tree[i] = self.segfunc(self.tree[2*i],self.tree[2*i+1])
    def gindex(self,l,r):
        l += self.num
        r += self.num
        lm = l>>(l&-l).bit_length()
        rm = r>>(r&-r).bit_length()
        while r>l:
            if l<=lm:
                yield l
            if r<=rm:
                yield r
            r >>= 1
            l >>= 1
        while l:
            yield l
            l >>= 1
    def propagates(self,*ids):
        for i in reversed(ids):
            v = self.lazy[i]
            if v is None:
                continue
            self.lazy[i] = None
            self.lazy[2*i] = v
            self.lazy[2*i+1] = v
            self.tree[2*i] = v
            self.tree[2*i+1] = v
    def update(self,l,r,x):
        ids = self.gindex(l,r)
        self.propagates(*self.gindex(l,r))
        l += self.num
        r += self.num
        while l<r:
            if l&1:
                self.lazy[l] = x
                self.tree[l] = x
                l += 1
            if r&1:
                self.lazy[r-1] = x
                self.tree[r-1] = x
            r >>= 1
            l >>= 1
        for i in ids:
            self.tree[i] = self.segfunc(self.tree[2*i], self.tree[2*i+1])
    def query(self,l,r):
        ids = self.gindex(l,r)
        self.propagates(*self.gindex(l,r))
        res = self.ide_ele
        l += self.num
        r += self.num
        while l<r:
            if l&1:
                res = self.segfunc(res,self.tree[l])
                l += 1
            if r&1:
                res = self.segfunc(res,self.tree[r-1])
            l >>= 1
            r >>= 1
        return res


N, A = map(int, input().split())
X = list(map(int, input().split()))
T = int(input())
LR = []
for i in range(T):
    l, r = map(int, input().split())
    LR.append((l, r))

X_idx = []
for i in range(N):
    X_idx.append((X[i], i))
X_idx.sort()
X_sorted = sorted(X)
X_min = X_sorted[0]
X_max = X_sorted[-1]

#print('X_min', X_min, 'X_max', X_max)

from bisect import bisect_left, bisect_right

hear = [-1]*N
LSTRU = LazySegTree_RUQ(hear, segfunc, -1)
for i in range(T):
    l, r = LR[i]
    if l > X_max or r < X_min:
        continue
    
    l_idx = bisect_left(X, l)
    r_idx = bisect_left(X, r+1)
    #print('i', i, 'l_idx', l_idx, 'r_idx', r_idx)
    # 中間に落ちてしまうケースがある
    if l_idx < r_idx and l_idx < N and r_idx >= 1:
        LSTRU.update(l_idx,r_idx,i+1)

    #temp = []
    #for i in range(N):
    #    calc = LSTRU.query(i, i+1)
    #    temp.append(calc)
    #print(temp) 
    
ans_list = [-1]*N
for i in range(N):
    calc = LSTRU.query(i, i+1)
    ans_list[X_idx[i][1]] = calc

for a in ans_list:
    print(a)