A neighborhood tool-lending library owns several models of hand tools, each purchased in some fixed total quantity. Whenever a member checks out one unit of a tool, the front desk appends that tool's id to a running checkout log; when a unit is returned, the desk simply deletes that entry, so the log always lists exactly the units presently on loan. Given the library's full inventory and today's checkout log, report every tool model that is currently checked out down to zero -- that is, every unit the library owns of that model is on loan right now, leaving nothing available for a walk-in member.

Input format

Line 1: an integer n -- the number of tool models. Each of the next n lines contains two integers id_i and copies_i -- the model's unique identifier and the total number of units the library owns of that model. The next line contains an integer m -- the number of units currently on loan. The next line contains m space-separated integers -- the checkout log, one tool id per unit on loan (each id refers to one of the n models above); if m = 0 this line is empty.

Output format

Print, in strictly increasing order and space-separated on one line, the ids of every model with zero units currently available. If no model qualifies, print an empty line.

Constraints

• 1 <= n <= 2 * 10^5
• All id_i are distinct integers in [1, 10^6].
• 1 <= copies_i <= 1000
• 0 <= m <= 2 * 10^5
• Every integer in the checkout log equals some id_i from the inventory list, and for each model the number of times its id appears in the log never exceeds that model's copies_i.

3
1 2
2 1
3 3
4
1 1 2 3

1 2

2
5 2
7 1
0

(empty)