Torrent

The torrent program Hwiwon uses splits a single file into several pieces and shares it piece by piece. While a seed that holds some of those pieces is online, Hwiwon receives pieces from that seed and puts the file together. A seed hands the pieces it holds to other users during the time it stays online.

Hwiwon wants one file that is split into $n$ pieces. Each seed comes with its online window and the pieces it holds, and the pieces held by everyone other than Hwiwon never change. Find the minimum time Hwiwon needs to receive every piece of the file.

Seeds hold different pieces and they come online at different times. Receiving one piece takes 1 second, so Hwiwon cannot receive pieces from two seeds during the same second. For example, if a seed arrives at second 0 and leaves at second 3, Hwiwon can receive at most 3 pieces from it. Hwiwon is online from second 0 onward.

All pieces are numbered from 1 to $n$.

The first line contains the number of test cases $T$.

The first line of each test case contains the number of pieces the file is split into, $n$ ($1 \le n \le 100$), and the number of seeds sharing the pieces, $m$ ($1 \le m \le 100$). Each of the next $m$ lines describes one seed with the time it comes online $t_1$ ($0 \le t_1 \le 100$), the time it leaves $t_2$ ($t_1 \le t_2 \le 100$), the number of pieces it holds $a$ ($0 \le a \le n$), and then the $a$ piece numbers $q_i$ ($1 \le q_i \le n$, $1 \le i \le a$).

For each test case, print on one line the minimum time needed to receive the whole file. If no further seed comes online and some piece is still missing, print -1.