Technology Planning

In a culture simulation game your culture develops technologies. Some technologies depend on others. If technology A depends on technology B, you can develop A only after B is developed. Your culture works on one technology at a time.

The game gives you goals that require particular technologies. Given the goal technologies, compute the smallest number of technologies you have to research and the order in which to research them.

The first line holds the number of test cases, $T$. $T$ test cases follow, each one shaped like this.

• One line with an integer $M$, the number of dependencies.
• $M$ lines, each with 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 sequence of letters and digits. Names are case sensitive.

Limits

• $1 \le T \le 25$
• $1 \le M \le 10$
• $1 \le Q \le 10$
• The dependency graph has no cycles.
• The same dependency or the same goal technology can appear more than once.
• A goal technology can be absent from every dependency.

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, each holding one technology, in the order they are researched.

When several orders satisfy the rules, print only the lexicographically smallest one. To compare two orders, find the first position where the technology names differ and compare those names by Unicode code point, so digits come before uppercase letters and uppercase letters come before lowercase letters.