A logistics operator flags one client account by name after a dispute, and now needs to know which field agents have a completely clear record with that account: agents who have never been assigned to fulfil an order for any client sharing the flagged name.

Input format

Line 1: three integers A, C, O — the number of field agents, the number of client accounts, and the number of orders. Next A lines: each contains an integer agent_id and a string agent_name (a token of letters and digits, 1–30 characters). Agent ids are distinct. Next C lines: each contains an integer client_id and a string client_name (a token of letters and digits, 1–30 characters). Client ids are distinct, but client names need not be — more than one client account can share the same name. Next O lines: each contains three integers order_id, client_id, and agent_id, describing one order fulfilled by that agent for that client. order_id values are distinct; client_id and agent_id each refer to entries listed above. Last line: a single string flagged_name (a token of letters and digits, 1–30 characters).

Output format

Print the name of every field agent who was never assigned an order for any client whose name equals flagged_name, one name per line, sorted alphabetically ascending. (An agent with zero orders in total automatically qualifies.) If no agent qualifies, print a single line containing NONE.

Constraints

• 0 ≤ A ≤ 200, 0 ≤ C ≤ 200, 0 ≤ O ≤ 2000
• 1 ≤ agent_id, client_id, order_id ≤ 10^6
• agent_name, client_name, and flagged_name each consist of 1 to 30 letters and/or digits, with no spaces

3 2 2
1 Amara
2 Rohan
3 Priya
10 RedFin
20 BlueOx
101 10 1
102 20 2
RedFin

Priya
Rohan

2 1 1
1 Zoe
2 Ana
5 Acme
201 5 1
Ghost

Ana
Zoe