There are (n) blogs. The (i)-th blog mentioned (l_i) users in order as an array (a_i=a_{i,1},a_{i,2},\ldots,a_{i,l_i}). You are going to post all (n) blogs. Let us maintain a sequence (Q) that describes the list of users you have recently mentioned. You need to perform the following operation exactly (n) times: Choose an unposted blog (i) ((1\le i\le n)), then post it. This will cause the following operations for each (1\le j\le l_i) in order: If (a_{i,j}) already exists in (Q), then move (a_{i,j}) to the beginning of (Q). Otherwise, insert (a_{i,j}) at the beginning of (Q). If (a_{i,j}) already exists in (Q), then move (a_{i,j}) to the beginning of (Q). Otherwise, insert (a_{i,j}) at the beginning of (Q). Find the lexicographically smallest(^{\text{∗}}) (Q) after all (n) operations. (^{\text{∗}})An array (x) is lexicographically smaller than an array (y) if and only if one of the following holds: (x) is a prefix of (y), but (x \ne y); or in the first position where (x) and (y) differ, the array (x) has a smaller element than the corresponding element in (y). Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 1000)). The description of the test cases follows. The first line contains a single integer (n) ((1\le n\le 3000)) — the number of blogs. Then (n) lines follow, the (i)-th line starting with an integer (l_i) ((1\le l_i\le 3000)), describing the number of users mentioned in the (i)-th blog, which is followed by (l_i) integers (a_{i,1},a_{i,2},\ldots,a_{i,l_i}) ((1\le a_{i,j}\le 10^6)) — the list of users mentioned in the (i)-th blog. It is guaranteed that the sum of (n) over all test cases does not exceed (3000). Denote (\sum\limits_{i=1}^n l_i) as (L). It is guaranteed that the sum of $$$L$