import heapq

class Double_Heap:
    def __init__(self):
        self.__small=[]
        self.__large=[]
        self.__dict={}
        self.__length=0
        self.__sum=0

    def __bool__(self):
        return bool(self.__length)

    def __len__(self):
        return self.__length

    def __contains__(self, x):
        return self.is_exist(x)

    def push(self, x):
        self.__length+=1
        self.__sum+=x

        heapq.heappush(self.__small, x)
        heapq.heappush(self.__large, -x)

        if x in self.__dict:
            self.__dict[x]+=1
        else:
            self.__dict[x]=1

    def discard(self, x):
        """ x を消す (存在しない場合は何もしない). """

        if x not in self:
            return

        self.__dict[x]-=1
        if self.__dict[x]==0:
            del self.__dict[x]

        self.__length-=1
        self.__sum-=x

        while self.__small and (self.__small[0] not in self):
                heapq.heappop(self.__small)

        while self.__large and (-self.__large[0] not in self):
                heapq.heappop(self.__large)

    def is_exist(self, x):
        """ キューに x が存在するかどうかを判定する. """
        return x in self.__dict

    def get_min(self):
        assert self
        return self.__small[0]

    def pop_min(self):
        assert self
        x=self.get_min()
        self.discard(x)
        return x

    def get_max(self):
        assert self
        return -self.__large[0]

    def pop_max(self):
        assert self
        x=self.get_max()
        self.discard(x)
        return x

    def count(self, x):
        """ x の個数を求める. """

        return self.__dict.get(x,0)

    def sum(self):
        return self.__sum

    def __str__(self):
        return str(self.__dict)

    def __repr__(self):
        return "[Double Heap]: "+str(self)

#==================================================
def solve():
    N, A = map(int, input().split())
    X = list(map(int, input().split()))

    T = int(input())
    E = set(X)
    Sound = [None] * T
    for t in range(T):
        l, r = map(int, input().split())
        Sound[t] = (l,r)
        E.add(l); E.add(r)

    E_inv = {e:i for i,e in enumerate(sorted(E))}
    K = len(E_inv)

    person = [[] for _ in range(K)]
    for i in range(N):
        xj = E_inv[X[i]]
        person[xj].append(i)

    begin = [[] for _ in range(K)]
    end = [[] for _ in range(K)]
    for t,(l,r) in enumerate(Sound,1):
        lj = E_inv[l]; rj = E_inv[r]
        begin[lj].append(t)
        end[rj].append(t)

    H = Double_Heap()
    ans = [0] * N
    for j in range(K):
        for t in begin[j]:
            H.push(t)

        for i in person[j]:
            if H:
                ans[i] = H.get_max()
            else:
                ans[i] = -1

        for t in end[j]:
            H.discard(t)

    return ans

#==================================================
import sys
input=sys.stdin.readline
write=sys.stdout.write

write("\n".join(map(str, solve())))