Bracelet Crossings
Bessie the cow enjoys arts and crafts. In her free time, she has made n bracelets, conveniently numbered 1..n. The i-th bracelet is painted color i out of a set of n different colors. After constructing the bracelets, Bessie placed them on a table for display (which we can think of as the 2D plane). She was careful to arrange the bracelets to satisfy the following three conditions:
Every bracelet was a single closed polygonal chain - a series of vertices (points) connected sequentially by line segments, where the first and last points are the same (Feel welcome to consult the wikipedia page for more detail: polygonal chain),
No bracelet intersected itself (this corresponds to a "simple" polygonal chain); and
No two bracelets intersected.
Unfortunately, right after Bessie arranged the bracelets in such a careful manner, Farmer John drove by in his tractor, shaking the table and causing the bracelets to shift around and possibly break into multiple (not necessarily closed or simple) polygonal chains! Afterward, Bessie wanted to check whether the three conditions above still held. However, it was dark, so she couldn't see the bracelets anymore.
Fortunately, Bessie had a flashlight. She chose m vertical lines x = 1, x = 2, ..., x = m and for each line, she swept the beam of the flashlight along that line from y = −∞ to y = ∞, recording the colors of all bracelets she saw in the order they appeared. Luckily, no beam crossed over any vertex of any polygonal chain or two line segments at the same time. Furthermore, for each beam, every color that appeared appeared exactly twice.
Can you help Bessie use this information to determine whether it is possible that the bracelets still satisfy all three of the conditions above?
Input
The first line of contains the number of test cases t (1 ≤ t ≤ 50).
The first line of each test case contains two integers n (1 ≤ n ≤ 50) and m (1 ≤ m ≤ 50). Each test case then contains m additional lines. For each i from 1 to m, the i-th additional line contains an integer k[i] (0 ≤ k[i] ≤ 2n, k[i] even), followed by k[i] integers c[i1], c[i2], ..., c[iki] (c[ij] ∈ [1, n], every c[ij] appears zero or two times). This means that when Bessie swept her flashlight from (i, −∞) to (i, ∞), she encountered the colors c[i1], c[i2], ..., c[iki] in that order.
Output
For each test case, print YES if it is possible for the three conditions above to be satisfied. Otherwise, print NO.
Example
An example of a feasible bracelet configuration for the first case is:
For the fourth case, a feasible arrangement is the following:
