h2. Date de intrare

Input file $ucl.out$ contains on the first line $t$, the number of test cases.
 
On the first line of the input for each test you will have $n$, the number of teams playing.
 
On the next $n$ lines you will have $3$ integers, representing the number of wins, the number of draws and the number of losses the team got. The integers are *NOT* separated by spaces.
 

h2. Date de ieşire

Output file $ucl.out$ will contain $t$ lines, each of them containing the answer corresponding to that test case.

În fişierul de ieşire $ucl.out$ ...

h2. Restricţii

* $1 ≤ t ≤ 10^5$
* $2 ≤ n ≤ 4$
* For tests worth $10$ points, $n = 2$
* For tests worth $20$ more points, $2 ≤ n ≤ 3$
* For tests worth $10$ more points, $1 ≤ t ≤ 10$
* For tests worth $10$ more points, there are only valid group tables.

* $... ≤ ... ≤ ...$

h2. Exemplu
table(example). |_. ucl.in |_. ucl.out |

| 2
4
600
402
204
006
4
402
402
402
006
| Unique
Not unique

| This is some
  text written on
  multiple lines.
| This is another
  text written on
  multiple lines.

|
h3. Explicaţie

For the first testcase, the results are unique because we can uniquely determine that the first team won all the games against all other teams, the second team won all the games except for the ones lost against the first team and the third team won all the games against the fourth team.
 
For the second testcase, while we can uniquely determine that the fourth team lost twice against each other team, there are at least two ways of assigning game results such that each of the first three teams won twice and lost twice against the other two teams.

...

== include(page="template/taskfooter" task_id="ucl") ==