Serval is a new student in Japari Kindergarten.

There is an English course in the kindergarten. The teacher sets some writing tasks for students to improve their writing skills. Therefore, Serval has to complete an essay, in English.

You might know that in an essay, the author has to convince readers of several arguments by showing them evidence.

Serval have collected available arguments numbered from to that can be written in his essay. For the -th argument, Serval can conclude that -th argument is true when the arguments numbered are all true. Specially, the -th argument cannot be proven true by making conclusion when . It is guaranteed that for all (), and when .

At the beginning of his essay, Serval will set exactly one argument from all the arguments as the argument basis, which is regarded as true. Starting with the argument basis, Serval will claim that some other arguments are true by making conclusions to complete his essay. It can be shown that for the -th argument with , it can be true if and only if it is the argument basis.

Serval wants to maximize the number of true arguments in the essay, so he needs to set the argument basis optimally. However, as a kindergarten student, he cannot even find out the number of true arguments he can obtain.

Could you help him find out the answer?

输入描述:

Each test contains multiple test cases.

The first line contains an integer  () — the number of test cases.

For each test case:

The first line contains a single integer  () — the number of the available arguments.

For the -th line in the following  lines, there is an integer  () followed by  integers  () — the arguments required to make the conclusion for the -th argument. It is guaranteed that  for all  (), and  when .

It is guaranteed that the sum of  in all the test cases does not exceed  and the sum of  in all the test cases does not exceed .

输出描述:

For the -th test case, print a line containing "" (without quotes), where  is the number of the test case starting from  and  is the answer to the test case, which is the maximum number of true arguments when setting the argument basis optimally.

3
4
0
1 1
2 1 2
2 2 3
5
1 3
1 1
1 2
1 5
4 1 2 3 4
7
0
2 1 4
1 2
1 3
2 3 4
1 1
2 5 6

Case #1: 4
Case #2: 3
Case #3: 4

备注:

For the first sample, Serval can set the -st argument as the argument basis to obtain  true arguments in the essay. The following process shows how Serval makes conclusions in his essay.

 Set the -st argument as the argument basis, which is regarded as true.
 Conclude that -nd argument is true because -st argument is true.
 Conclude that -rd argument is true because both -st and -nd arguments are true.
 Conclude that -th argument is true because both -nd and -rd arguments are true.