import sys
input = sys.stdin.readline


N,A=map(int,input().split())
X=list(map(int,input().split()))

T=int(input())
LR=[list(map(int,input().split())) for i in range(T)]

LIST=[]
for x in X:
    LIST.append(x)

for l,r in LR:
    LIST.append(l)
    LIST.append(r)

S=sorted(set(LIST))
D={S[i]:i for i in range(len(S))}


for i in range(N):
    X[i]=D[X[i]]

for i in range(T):
    LR[i][0]=D[LR[i][0]]
    LR[i][1]=D[LR[i][1]]

seg_el=1<<((max(X)+1).bit_length()) # Segment treeの台の要素数
SEG=[-1]*(2*seg_el) # 1-indexedなので、要素数2*seg_el.Segment treeの初期値で初期化

def getvalue(n,seg_el): # 一点の値を取得
    i=n+seg_el
    ANS=-1
    
    ANS=max(SEG[i],ANS)
    i>>=1# 子ノードへ
    
    while i!=0:
        ANS=max(SEG[i],ANS)
        i>>=1

    return ANS

def updates(l,r,x): # 区間[l,r)のminを更新.
    L=l+seg_el
    R=r+seg_el

    while L<R:
        if L & 1:
            SEG[L]=max(x,SEG[L])
            L+=1

        if R & 1:
            R-=1
            SEG[R]=max(x,SEG[R])
        L>>=1
        R>>=1

for i in range(T):
    l,r=LR[i]

    updates(l,r+1,i+1)

for i in range(N):
    print(getvalue(X[i],seg_el))