Actors

Police officers cannot spend all their time working. Like anyone else, they need a hobby. So a group of police dog handlers founded an amateur theatre company called Kynologický soubor italského národního divadla a literatury (the Canine Company of the Italian National Theatre and Literature), or KSINDL for short. Its members play every show with enormous verve and personal commitment.

Then things went wrong. On the very day of the public premiere of their new play, a large part of the company was called out to an operation against unruly demonstrators. Work is work, so the theatre had to step aside and some members cannot appear at the premiere. Luckily, as in every decent amateur company, many actors have also rehearsed several roles besides their own well enough to play them. Filling every role from the people who are left is still not always possible, so the officers want a program that reviews the situation and decides whether the play can be staged with the cast that remains.

An actor takes at most one role in the performance, and every role needs a different actor. Decide whether all roles can be filled by the actors who are able to appear.

The first line contains a positive integer $Z$, followed by $Z$ test cases in order.

Each test case begins with a line holding three integers separated by spaces: the number of actors in the company $H$ ($1 \le H \le 100$), the number of roles in the play to be staged that evening $R$ ($1 \le R \le 60$), and the number of actors who cannot attend the premiere because of duty $A$ ($0 \le A \le H$).

Exactly $H$ lines follow, each with the name of one actor. A name consists only of lowercase and uppercase letters, at least 1 and at most 30 of them. Uppercase and lowercase letters count as different characters.

Next come $R$ lines, each with the name of one role. The same rules apply as for actor names.

After the list of roles comes the list of which roles each actor can play, spread over $H$ lines. A line holds the actor's name, one space, the number $U_i$ of roles that actor can play, one space, and then $U_i$ role names separated by spaces. The whole list for one actor sits on a single line, and the next actor follows on the next line. The list has exactly $H$ entries, so every actor appears once, but not necessarily in the order in which the names were listed earlier.

The test case ends with $A$ lines, each holding the name of one actor who cannot play.

Print exactly one line for each test case. If the play can be staged under the given circumstances, print Premiera bude!, otherwise print Zatraceni demonstranti!.