Sickly Yeongjeong

Yeongjeong is sickly. He knows it, so he keeps a stock of medicine with him and can take it at any time. Every medicine is labeled with its name and with the one symptom it treats, and a single medicine treats exactly one symptom. No two medicines share a name, and no two medicines treat the same symptom.

Given the symptoms Yeongjeong complains about, print the medicine he has to take.

The program reads from standard input.

The first line holds the number of kinds of medicine $N$. ($1 \le N \le 100$)

Each of the next $N$ lines holds the symptom the medicine treats $M_e$ and the name of the medicine $M_n$, both as numbers. ($0 \le M_e, M_n \le 100$) No two medicines share a name, and no two medicines treat the same symptom.

The next line holds the number of symptom lists $R$. ($1 \le R \le 100$)

Each of the next $R$ lines holds a count $L_i$ followed by the symptoms $S_1, S_2, \dots, S_{L_i}$. ($1 \le L_i \le N$, $0 \le S_j \le 100$) The symptoms on one line are distinct.

The program writes to standard output.

For each of the $R$ symptom lists, print one line with the names of the medicines to take, separated by spaces, in the order the symptoms were given.

If at least one symptom on a line cannot be treated, print YOU DIED on that line instead.