A regional distribution center keeps a live list of loading docks that are currently in operation. Over time some docks get decommissioned, but nobody goes back and updates the staff roster, so a handful of employees end up "assigned" to a dock that no longer exists. You've been asked to sweep the roster and flag exactly those employees so facilities can reassign them.

Input format

• Line 1: a single integer D, the number of currently active docks.
• Line 2: D space-separated integers, the IDs of the active docks (all distinct). No tokens appear on this line when D = 0.
• Line 3: a single integer E, the number of employees on the roster.
• The next E groups each contribute three whitespace-separated tokens: an integer employee ID, the employee's name (a single token with no spaces), and an integer dock ID the employee is currently assigned to.

Output format

Print one line <employee_id> <name> for every employee whose assigned dock ID is not among the active dock IDs, ordered by ascending employee ID. If no employee qualifies, print nothing.

Constraints

• 0 ≤ D ≤ 1000, 0 ≤ E ≤ 1000
• 1 ≤ dock ID ≤ 10^6, all active dock IDs are distinct
• 1 ≤ employee ID ≤ 10^6, all employee IDs are distinct
• Employee names consist of 1 to 20 letters (a-z, A-Z)
• An assigned dock ID may or may not appear among the active dock IDs, and the same dock ID may be assigned to several employees

3
10 20 30
4
1 alice 10
2 bob 25
3 carol 20
4 dave 99

2 bob
4 dave

2
5 6
2
100 zack 5
101 amy 6

(empty)