import sys

sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

class DualSegTree:
    def __init__(self, op, e, v):
        self._op = op
        self._e = e()
        if isinstance(v, int): v = [self._e]*v
        self._n = len(v)
        self._log = (self._n-1).bit_length()
        self._size = 1 << self._log
        self._d = [self._e]*(2*self._size)

        for i in range(self._n):
            self._d[self._size+i] = v[i]

    def apply(self, left, right, f):
        assert 0 <= left <= right <= self._n
        if left == right: return
        left += self._size
        right += self._size

        for i in range(self._log, 0, -1):
            if ((left >> i) << i) != left:
                self._push(left >> i)
            if ((right >> i) << i) != right:
                self._push((right-1) >> i)

        while left < right:
            if left & 1:
                self._d[left] = self._op(self._d[left], f)
                left += 1
            if right & 1:
                right -= 1
                self._d[right] = self._op(self._d[right], f)
            left >>= 1
            right >>= 1

    def get(self, p):
        assert 0 <= p < self._n
        p += self._size
        res = self._e
        while p:
            res = self._op(res, self._d[p])
            p >>= 1
        return res

    def all_array(self):
        res = []
        for i in range(self._n):
            res.append(self.get(i))
        return res

    def _push(self, k):
        self._d[k*2] = self._op(self._d[k*2], self._d[k])
        self._d[k*2+1] = self._op(self._d[k*2+1], self._d[k])
        self._d[k] = self._e

# ノードfの値をgで更新
def op(f, g):
    return min(f, g)

# 単位元
def e():
    return 10**16

n,a=LI()
xx=LI()
t=II()
lr=[]
dec=set(xx)
for _ in range(t):
    l,r=LI()
    r+=1
    lr.append((l,r))
    dec.add(l)
    dec.add(r)

enc={a:i for i,a in enumerate(sorted(dec))}
a=len(enc)
st=DualSegTree(max,lambda :-1,a+5)
for i,(l,r) in enumerate(lr,1):
    l=enc[l]
    r=enc[r]
    st.apply(l,r,i)
for x in xx:
    x=enc[x]
    print(st.get(x))