시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
5 초 128 MB 0 0 0 0.000%

## 문제

In Grid World, the Disc Arena is a location where programs play gladiator disc games against other programs. There are k games in the disc arena. By winning each game, you gain fame and become popular in the Grid World. Of course, if you lose a game, you are deleted. The amount of fame you gain by winning the ith game is fi (which may not necessary be positive). Furthermore, to be able to play in the ith game, you are required to have first played and won a specified subset Si of the games (known in advance) – the games in set Si are also called prerequisites. There are no cycles in the prerequisites structure, e.g., it can not happen that a game a is required for game b, b is required for game c, and c is required for playing game a. Note that, the only reason you would play a game with negative fame is because it is a prerequisite to a game with higher positive fame.

A set C of games is called feasible if for any game i ∈ C, all the prerequisites Si are also included in C, i.e., if i ∈ C, then Si ⊂ C. The fame associated with C is simply the sum of the fames of all games in C.

The goal is of course to become as famous as possible !! Given the fames and the prerequisites for a set of games, your goal is to find a feasible set of games with maximum fame.

For instance, consider the following sets of disc arena games. The prerequisites for each game are indicated using arrows between games. For the first set of games, game 1 has games 2 and 3 as prerequisites, and game 3 has game 2 as a prerequisite. The maximum possible fame is 2, achieved by selecting the set of games {1,2,3}. Game 3 must be selected even though it has a negative fame value, because it is a prerequisite for game 1. For the second set of games, the maximum fame is 3, achieved by selecting the set of games {1,2,4,6}. For the third set of games, the maximum fame is 0, achieved by selecting no games.

## 입력

The first line of the input is the number of test cases (≤ 100).

The first line in each test case lists k, the number of games (k ≤ 1000). The games are labeled 1 to k. The next k lines contain the information about the games. The (i + 1)th line is in the form “fidiu1u2···udi”. The first number is the fame you gain by playing game i, the second number is Si – the number of prerequisites, and the remaining numbers are members of Si.

Assume that in each scenario, the total number of prerequisites of all games, i.e., Σi|Si|, is ≤ 6000.

## 출력

For each scenario, print the maximum fame you can gain by playing a feasible set of games as shown below in the example.

## 예제 입력 1

3
3
3 2 2 3
1 0
-2 1 2
6
-1 0
3 1 1
2 2 5 2
2 1 6
-4 1 6
-1 0
10
-44 5 7 2 4 9 6
-2 1 5
10 3 4 9 6
-129 1 8
-71 0
34 1 5
-27 3 8 5 2
-121 2 6 2
169 3 6 7 8
-117 3 7 1 4


## 예제 출력 1

Case 1: Maximum attainable fame = 2
Case 2: Maximum attainable fame = 3
Case 3: Maximum attainable fame = 0