write a go solution for Description:
Vitya has a friend Masha, whom he really wants to invite to the festival, where his favorite bands perform. However, in order for a friend to agree, she must first evaluate the released novelties. Vitya knows that if Masha listens to a track that was cooler than all the previous ones, she will get 1 unit of impression. Unfortunately, albums can only be listened to in their entirety, without changing the songs in them in places.

Help Vitya find such an order of albums so that Masha's impression turns out to be as much as possible, and she definitely went to the festival with him.

Input Format:
Each test consists of multiple test cases. The first line contains a single integer t (1<=t<=200,000) — the number of test cases. The description of test cases follows.

The first line of each test case contains a single integer n (1<=n<=200,000) — number of albums.

The album descriptions follow. Each album description consists of two lines:

The first line contains a single integer k_i (1<=k_i<=200,000) — the number of tracks in the ith album.

The following line contains k_i integers a_i,1,a_i,2,a_i,3,ldots,a_i,k_i (1<=a_i,j<=200,000) — the coolness of the tracks in the i album.

Denote for sumk_i the sum of all k_i. It is guaranteed that sumk_i<=200,000.

Output Format:
For each test case print the singular number  — the maximum impression that Masha can get.

Note:
In the first test example, the optimal order is listening to the 4th, 2nd, 3rd and 1st albums.

In this case, Masha will listen to the tracks in the following order: 1; 7; 8, 6; 4, 9, 4, 6, 8 and will receive 4 units of impression.

In the second test example, you must first listen to the 1st, then the 4th, and in any order the 2nd and 3rd.   In this case, Masha will get the maximum impression, and for every song in the 1st and 4th albums and nothing for the 2nd and 3rd.. Output only the code with no comments, explanation, or additional text.