Henu is playing Bookworm, but there are too many words that he doesn’t know, so he created a system to define each word looking up the definition on the Internet, but the Internet is not always accurate and the definitions may have gone wrong, some of them could be invalid definitions. An invalid definition is a word that sooner or later defines itself. By example we have word A, B and C; word A can be defined with word B, word B can be defined with word C, and word C can be defined with word A, in that case, the definition of all A, B and C is invalid. Henu has made his definitions, and he wants to know how many of them are valid.

Input

The first line contains an integer T , which specifies the number of test cases. Then, will follow the descriptions of T test cases.

Each test case will start with one integer N , that is the number of words in Henu’s definitions. Then it will be the description of each word, each description is divided in 2 lines, the first line will have a word A and an integer M , the word to define, and the number of words that are used in the definition. Then a line with M words separated by spaces, the words that define A. Each word will have only lowercase characters [a − z] and will have up to 20 characters. All words used to define other words will always be on Henu’s definitions.

Output

For each input case you must print a single line with the string Scenario #i: x, where i is the number of the test case (starting at 1), and x is the answer for the problem.

Constraints Small - 40%

• 1 ≤ T ≤ 100

• 1 ≤ N ≤ 1000

Constraints Large - 60%

• 1 ≤ T ≤ 100

• 1 ≤ N ≤ 100000