import sys
input = sys.stdin.readline
from bisect import bisect_left,bisect_right,bisect

class LazySegmentTree:
    def __init__(self, size, f=lambda x, y: max(x, y), default=-1):
        self.size = (size - 1).bit_length()
        self._n = 2 ** self.size
        self.default = default
        self.data = [default] * (self._n * 2)
        self.lazy = [None] * (self._n * 2)
        self.f = f

    def _get_index(self, l, r):
        L = (l + self._n) >> 1
        R = (r + self._n) >> 1
        lc = 0 if l & 1 else (L & -L).bit_length()
        rc = 0 if r & 1 else (R & -R).bit_length()
        for i in range(self.size):
            if rc <= i:
                yield R
            if L < R and lc <= i:
                yield L
            L >>= 1
            R >>= 1

    def _propagates(self, *ids):
        for i in reversed(ids):
            v = self.lazy[i - 1]
            if v is None:
                continue
            self.lazy[2 * i - 1] = self.data[2 * i - 1] = v
            self.lazy[2 * i    ] = self.data[2 * i    ] = v
            self.lazy[i - 1] = None

    def update(self, l, r, x):  # [l,r)
        *ids, = self._get_index(l, r)
        self._propagates(*ids)
        L = self._n + l
        R = self._n + r
        while L < R:
            if R & 1:
                R -= 1
                self.lazy[R - 1] = self.data[R - 1] = x
            if L & 1:
                self.lazy[L - 1] = self.data[L - 1] = x
                L += 1
            L >>= 1
            R >>= 1
        for i in ids:
            self.data[i - 1] = self.f(self.data[2 * i - 1], self.data[2 * i])

    def query(self, l, r):  # [l,r)
        self._propagates(*self._get_index(l, r))
        L = self._n + l
        R = self._n + r
        res = self.default
        while L < R:
            if R & 1:
                R -= 1
                res = self.f(res, self.data[R - 1])
            if L & 1:
                res = self.f(res, self.data[L - 1])
                L += 1
            L >>= 1
            R >>= 1
        return res

N,A=map(int,input().split())
X=list(map(int,input().split()))
T=int(input())
LR=[list(map(int,input().split())) for _ in range(T)]
Xi = list(enumerate(X))
Xi.sort(key=lambda x:x[1])
X.sort()
st = LazySegmentTree(N)
for t,(l,r) in enumerate(LR,start=1):
    il = bisect_left(X,l)
    ir = bisect_right(X,r)
    st.update(il,ir,t)

ans = [0]*N
for i,(j,_) in enumerate(Xi):
    ans[j] = st.query(i,i+1)
print(*ans,sep="\n")