#!/usr/bin/env python3

c=10000
n, k = map(int, input().split())
cc = [[] for _ in range(c+1)]
cc2= [[] for _ in range(c+1)]
for i in range(1, n+1):
    a, b = map(int, input().split())
    if a > b: cc2[b].append(i)
    if a == b: cc[a].append(i)
    if a < b: cc2[a].append(i)

ans = []
for c in map(int, input().split()):
    if len(cc[c]) > 0: ans.append(cc[c].pop())
    elif len(cc2[c-1]) > 0: ans.append(cc2[c-1].pop())
    elif len(cc2[c-0]) > 0: ans.append(cc2[c-0].pop())
    else:
        print('impossible')
        exit()
print(*ans, sep='\n')