class LazySegmentTreeUpdate:
    def segfunc(self,x,y):
        return min(x,y)
    def __init__(self,first_list,first_value):
        n = len(first_list)
        self.first_value = first_value
        self.num = 1<<(n-1).bit_length()
        self.data = [first_value]*2*self.num
        self.lazy = [None]*2*self.num
        for i in range(n):
            self.data[self.num+i] = first_list[i]
        for i in range(self.num-1,0,-1):
            self.data[i] = self.segfunc(self.data[2*i],self.data[2*i+1])
    def gindex(self,l,r):
        l += self.num; lm = l>>(l&-l).bit_length()
        r += self.num; rm = r>>(r&-r).bit_length()
        while l<r:
            if r<=rm: yield r
            if l<=lm: yield l
            l >>= 1; r >>= 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[2*i] = v; self.lazy[2*i+1] = v
            self.data[2*i] = v; self.data[2*i+1] = v
            self.lazy[i] = None
    def update(self,l,r,x):
        *ids,= self.gindex(l,r)
        self.propagates(*ids)
        l += self.num; r += self.num
        while l<r:
            if l&1:
                self.lazy[l] = x; self.data[l] = x
                l += 1
            if r&1:
                self.lazy[r-1] = x; self.data[r-1] = x
            l >>= 1; r >>= 1
        for i in ids:
            self.data[i] = self.segfunc(self.data[2*i],self.data[2*i+1])
    def query(self,l,r):
        *ids,= self.gindex(l,r)
        self.propagates(*ids)
        res = self.first_value
        l += self.num; r += self.num
        while l<r:
            if l&1:
                res = self.segfunc(res,self.data[l])
                l += 1
            if r&1:
                res = self.segfunc(res,self.data[r-1])
            l >>= 1; r >>= 1
        return res
n,a = map(int,input().split())
x = list(map(int,input().split()))
s = set(x); t = int(input()); lr = []
for _ in range(t):
    l,r = map(int,input().split())
    s |= {l,r+1}; lr.append((l,r+1))
d = {v:i for i,v in enumerate(sorted(s))}
lst = LazySegmentTreeUpdate([10**6]*len(d),10**6)
for i in range(t): lst.update(d[lr[i][0]],d[lr[i][1]],i+1)
for v in x:
    i = lst.query(d[v],d[v]+1)
    print(i if i<10**6 else -1)