20250612
# from math import inf
# n,k=map(int,input().split())
# a=list(map(int,input().split()))
# b=[-1 for i in range(105)]
# c=[0 for i in range(k)]
# for i in range(k-1,-1,-1):
# if b[a[i]]==-1:
# c[i]=inf
# else:
# c[i]=b[a[i]]
# b[a[i]]=i
# # print(c)
# st=[]
# s=0
# for i in range(k):
# f=0
# for j in range(len(st)):
# if st[j][0]==a[i]:
# f=1
# st[j][1]=c[i]
# break
# if f==1:
# continue
# if len(st)<n:
# st.append([a[i],c[i]])
# else:
# m=0
# u=0
# for j in range(n):
# if st[j][1]>u:
# u=st[j][1]
# m=j
# if f == 1:
# # print(st)
# continue
# st[m]=[a[i],c[i]]
# s=s+1
# # print(st,s)
# print(s)
from queue import PriorityQueue
n,k=map(int,input().split())
q=PriorityQueue()
a=[]
b=[]
for i in range(n):
x,y=map(int,input().split())
a.append([x,y])
for i in range(k):
x=int(input())
b.append(x)
a=sorted(a,key=lambda x:x[0])
b.sort()
for i in range(k):
x=b[i]
for j in range(n):
if a[j][]