Each input case contains T

sub-cases (1≤T≤50) that must all solved independently to solve the full input case. Consecutive test cases are separated by newlines.

The first line of the input contains T. Each of the T sub-test cases then follow.

The first line of each sub-test case contains two integers N and M. Each sub-test case then contains M additional lines. For each i from 1 to M, the i-th additional line contains an integer ki (0≤ki≤2N, kieven), followed by ki integers ci1,ci2,…,ciki(cij∈[1,N], every cij appears zero or two times). This means that when Bessie swept her flashlight from (i,−∞) to (i,∞) , she encountered the colors ci1,ci2,…,cikiin that order.

#5762 upload 9 done 2 how_to_reg 2

Bracelet Crossings timer 2s memory 1024MB

#5762

Bracelet Crossings 2s 1024MB