import bisect
import sys
input=sys.stdin.readline
F=lambda:[*map(int,input().split())]
INF=1<<60

N,M=F()
A=[F()for _ in range(N)]
B=[F()for _ in range(M)]
S=set()
for x,y in A:S.add(x)
S=sorted(S)
SN=len(S)
DIC={S[i]:i for i in range(SN)}
for i in range(N):A[i][0]=DIC[A[i][0]]

ST=[[]for _ in range(2*SN)]
VIS=[INF]*M
def upd(l,r,idx):
  l+=SN; r+=SN
  while l<=r:
    if l&1==1:ST[l].append(idx)
    if r&1==0:ST[r].append(idx)
    l=l+1>>1; r=r-1>>1
def qry(p,y):
  p+=SN; ret=-1
  while p:
    while ST[p] and VIS[ST[p][-1]]<y:ST[p].pop()
    if ST[p] and H[ST[p][-1]]>H[ret]:ret=ST[p][-1]
    p>>=1
  VIS[ret]=y
  return H[ret]

ANS=[0]*N
ID=[i for i in range(N)]
ID.sort(key=lambda x:A[x][1])
B.sort(key=lambda x:x[2])
H=[B[i][2] for i in range(M)]+[0]

j=0
for i in ID:
  x,y=A[i]
  while j<M and H[j]<y:
    x1,x2,_=B[j]
    l=bisect.bisect_left(S,x1)
    r=bisect.bisect_right(S,x2)-1
    upd(l,r,j)
    j+=1
  ANS[i]=qry(x,y)

print(*ANS,sep='\n')