Alternative Accounts

Everybody knows that jiry_2 = Syloviaely.

There are $n$ different accounts on the website, and some of them competed in the recent $k$ contests. Mike suspects that there are many alternative accounts, meaning two or more accounts owned by the same person.

Two axioms are believed by everyone:

• Nobody can use two different accounts in one contest at the same time.
• Nobody shares an account. Each account can only be owned by one person.

So, a set of accounts may be owned by the same person if no two of them took part in the same contest.

Mike wants to know the minimum possible number of different people behind the given list of accounts.

The first line contains an integer $T$ ($1 \le T \le 10^5$), the number of test cases. Each test case is described as follows.

The first line contains two integers $n$ and $k$ ($1 \le n \le 10^5$, $1 \le k \le 4$).

Each of the following $k$ lines starts with an integer $m$ ($1 \le m \le n$), followed by $m$ distinct integers $x_i$ ($1 \le x_i \le n$), the accounts that took part in that contest.

Some accounts may not take part in any contest.

It is guaranteed that $\sum n \le 5 \times 10^5$.

For each test case, print one line with one integer: the answer.