An expedition outfitter keeps a certification roster: every crew member who has earned a wilderness certification (first aid, rope rescue, cold-water rescue, and so on) has one roster entry per certification they hold. A newly announced expedition specifies a fixed list of required certifications -- anyone assigned to it must hold every one of them, though holding additional, non-required certifications is perfectly fine. Given the roster and the expedition's required list, find every crew member who is fully qualified for the expedition.

Input format

Line 1: an integer k -- the number of required certifications. Line 2: k space-separated strings -- the required certification names (pairwise distinct). Line 3: an integer n -- the number of roster entries. Each of the next n lines contains an integer crew_id and a string certification, meaning that crew member holds that certification. A crew member may hold several certifications (one roster entry each), and, occasionally, the exact same (crew_id, certification) pair may appear more than once without changing the outcome.

Output format

Print, in strictly increasing order and space-separated on one line, the ids of every crew member who holds all k required certifications. If nobody qualifies, print an empty line.

Constraints

• 1 <= k <= 20
• Each required certification name has length 1-20, made of lowercase English letters and digits.
• 1 <= n <= 2 * 10^5
• 1 <= crew_id <= 10^6
• Each certification name appearing in the roster has length 1-20, made of lowercase English letters and digits.

2
firstaid rope
6
101 firstaid
101 rope
101 climbing
102 firstaid
102 rope
103 rope

101 102

3
firstaid rope wilderness
5
5 firstaid
5 rope
5 wilderness
5 firstaid
9 firstaid

5