Ross and Rachel are on a date. Ross, being the super geek he is, takes Rachel to see dinosaur exhibits.
Each dinosaur has a name and K attributes which are described by an ordered K-tuple ( A₁, A₂, A₃,..., A_K ). Each attribute A_i is an integer between 0 to L inclusive. Ross tells Rachel about N dinosaurs. For each dinosaur, he tells her its name and gives her the K-tuple describing its attributes.
Afterwards, he wants to play a quiz with Rachel. He gives Rachel Q K-tuples and ask her which dinosaur they belongs to. As Rachel loves Ross and doesn't want him to think she wasn't paying attention, she wants to answer all questions correctly. Help her in this task.

Input:
The first line contains N, K, L and Q, the number of dinosaurs, the size of the K-tuple, the maximum value of any attribute and the number of questions that Ross asks.
N lines follow. The next i^th line contains a string which is the name of the i^th dinosaur and K space separated integer which are the attributes for the i^th dinosaur.
Q lines follow. The next i^th line contains K space separated integer denoting a K-tuple.

Output:
For each question, output the name of the dinosaur that the K-tuple belongs to.
It is also possible that Ross is asking a trick question and the tuple doesn't describe any dinosaur. In such a case, output "You cant fool me :P" (Quotes are for clarity)

Constraints:
1<=N<=100000
1<=K<=5
1<=L<=15
1<=Q<=100000
0<=A_i<=L
1<=Length of Dinosaur's name<=10
Dinosaur's name will contain only lowercase alphabets [a-z].

Note:
No two dinosaurs will have the same K-tuple or name.