Problem: We guessed a permutation p consisting of n integers. The permutation of length n is the array of length n where each element from 1 to n appears exactly once. This permutation is a secret for you.

For each position r from 2 to n we chose some other index l (l < r) and gave you the segment p_l, p_{l + 1}, ..., p_r in sorted order (i.e. we rearranged the elements of this segment in a way that the elements of this segment are sorted). Thus, you are given exactly n-1 segments of the initial permutation but elements inside each segment are sorted. The segments are given to you in random order.

For example, if the secret permutation is p=[3, 1, 4, 6, 2, 5] then the possible given set of segments can be:

  * [2, 5, 6] 
  * [4, 6] 
  * [1, 3, 4] 
  * [1, 3] 
  * [1, 2, 4, 6] 



Your task is to find any suitable permutation (i.e. any permutation corresponding to the given input data). It is guaranteed that the input data corresponds to some permutation (i.e. such permutation exists).

You have to answer t independent test cases.

Input

The first line of the input contains one integer t (1 ≤ t ≤ 100) — the number of test cases. Then t test cases follow.

The first line of the test case contains one integer n (2 ≤ n ≤ 200) — the length of the permutation.

The next n-1 lines describe given segments.

The i-th line contains the description of the i-th segment. The line starts with the integer k_i (2 ≤ k_i ≤ n) — the length of the i-th segment. Then k_i integers follow. All integers in a line are distinct, sorted in ascending order, between 1 and n, inclusive.

It is guaranteed that the required p exists for each test case.

It is also guaranteed that the sum of n over all test cases does not exceed 200 (∑ n ≤ 200).

Output

For each test case, print the answer: n integers p_1, p_2, ..., p_n (1 ≤ p_i ≤ n, all p_i should be distinct) — any suitable permutation (i.e. any permutation corresponding to the test case input).

Example

Input


5
6
3 2 5 6
2 4 6
3 1 3 4
2 1 3
4 1 2 4 6
5
2 2 3
2 1 2
2 1 4
2 4 5
7
3 1 2 6
4 1 3 5 6
2 1 2
3 4 5 7
6 1 2 3 4 5 6
3 1 3 6
2
2 1 2
5
2 2 5
3 2 3 5
4 2 3 4 5
5 1 2 3 4 5


Output


3 1 4 6 2 5 
3 2 1 4 5 
2 1 6 3 5 4 7 
1 2 
2 5 3 4 1 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
using cd = complex<double>;
const long long INF = 1e15;
const int N = 3e5 + 2;
const int mod = 1e9 + 7;
const double Pi = acos(-1);
void Fastio() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
}
int tc;
int n;
int a[205], pos[205], c[205];
set<int> Set[205], S[205];
bool Check() {
  for (int i = 1; i <= n; i++) {
    pos[a[i]] = i;
  }
  for (int i = 1; i <= n - 1; i++) {
    int mn = n;
    for (auto x : Set[i]) {
      mn = min(mn, pos[x]);
    }
    for (int j = mn; j <= mn + Set[i].size() - 1; j++) {
      if (Set[i].count(a[j]) == false) {
        return false;
      }
    }
  }
  return true;
}
void Solve() {
  cin >> n;
  for (int i = 1; i <= n - 1; i++) {
    Set[i].clear();
  }
  for (int i = 1; i <= n - 1; i++) {
    int sz;
    cin >> sz;
    while (sz--) {
      int tmp;
      cin >> tmp;
      Set[i].insert(tmp);
    }
  }
  for (int First = 1; First <= n; First++) {
    int cnt = 0;
    for (int i = 1; i <= n - 1; i++) {
      S[i] = Set[i];
      S[i].erase(First);
      cnt += (S[i].size() == 1);
    }
    if (cnt != 1) {
      continue;
    }
    a[1] = First;
    bool ok = true;
    for (int i = 2; i <= n; i++) {
      int tmpcnt = 0;
      for (int j = 1; j <= n - 1; j++) {
        tmpcnt += (S[j].size() == 1);
        if (S[j].size() == 1) {
          a[i] = *S[j].begin();
        }
      }
      if (tmpcnt != 1) {
        ok = false;
        break;
      }
      for (int j = 1; j <= n - 1; j++) {
        S[j].erase(a[i]);
      }
    }
    if (ok) {
      if (Check()) {
        for (int i = 1; i <= n; i++) {
          cout << a[i] << ' ';
        }
        cout << '\n';
        return;
      }
    }
  }
}
signed main() {
  Fastio();
  cin >> tc;
  while (tc--) {
    Solve();
  }
}