Technology Planning

You are playing a culture simulation game in which your culture develops technologies. Some technologies depend on others. If technology A depends on technology B, you have to develop B before you can develop A. Your culture develops one technology at a time.

The game gives you goals that require particular technologies. Write a program that plans which technologies to develop, and in what order, so that every goal technology is reached.

The first line holds the number of test cases, $T$. Then $T$ test cases follow, each one in this form.

• One line with an integer $M$, the number of dependencies.
• $M$ lines, each holding two technology names separated by a colon (:). The first technology depends on the second one.
• One line with an integer $Q$, the number of goal technologies.
• $Q$ lines, each naming one goal technology.

A technology name is a string of letters and digits, and names are case sensitive. The same dependency or the same goal technology may be given more than once. A goal technology may appear in no dependency line at all.

Limits

• $1 \le T \le 25$
• $1 \le M \le 100$
• $1 \le Q \le 100$
• The dependency graph has no cycles.

For each test case, first print a line of the form "Case #$C$: $D$", where $C$ is the test case number starting from 1 and $D$ is the smallest number of technologies that have to be researched. Then print $D$ lines, one technology name per line, in the order they are researched.

If several orders satisfy the dependencies, print only the lexicographically smallest one. Compare two orders line by line from the first line, and compare technology names by the ASCII value of their characters, so digits come before uppercase letters and uppercase letters come before lowercase letters.