A supply convoy travels as a single line of wagons, each carrying one cargo id. A safety office maintains a flagged list of cargo ids that are no longer permitted in the convoy; if a cargo id appears anywhere on the flagged list (the list may itself repeat an id), every wagon carrying that id must be pulled, no matter where it sits in the line or how many wagons share that id. After the pull, the surviving wagons are re-coupled in their original left-to-right order, with no gaps. Report the cargo ids of the surviving wagons, in order.

Input format

The first line contains an integer n, the number of wagons in the convoy. The second line contains n integers, the cargo ids of the wagons in order. The third line contains an integer m, the number of entries on the flagged list. The fourth line (present even when m = 0, in which case it is empty) contains m integers, the flagged cargo ids.

Output format

Print one line containing the cargo ids of the surviving wagons, in their original order, separated by single spaces. If no wagons survive, print an empty line.

Constraints

• 1 <= n <= 10^5
• 0 <= m <= 10^5
• 1 <= cargo id, flagged id <= 10^9
• The convoy may contain repeated cargo ids, and the flagged list may contain repeated ids.

6
9 14 6 14 20 6
2
14 20

9 6 6

1
5
3
5 5 5

(empty)