#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353, N = 210;
int t, n, ans[N], bel[N];
vector<int> seg[N];
set<int> app[N];
inline int addMod(int a, int b) { return (a += b) >= mod ? a - mod : a; }
inline long long quickpow(long long base, long long pw) {
  long long ret = 1;
  while (pw) {
    if (pw & 1) ret = ret * base % mod;
    base = base * base % mod, pw >>= 1;
  }
  return ret;
}
template <class T>
inline void read(T &x) {
  x = 0;
  char ch = getchar(), w = 0;
  while (!isdigit(ch)) w = (ch == '-'), ch = getchar();
  while (isdigit(ch)) x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
  x = w ? -x : x;
  return;
}
int dfs(int m) {
  int vis[N];
  for (register int i = 1; i <= n; ++i) vis[i] = 0;
  int num = 0;
  for (register int i = m + 1; i <= n; ++i) {
    if ((int)seg[bel[i]].size() <= i - m) continue;
    ++num, --vis[ans[i]];
    for (auto &v : seg[bel[i]]) ++vis[v];
  }
  if (m == 1) {
    for (register int i = 1; i <= n; ++i)
      if (vis[i] == num) return ans[1] = i, 1;
    return 0;
  }
  pair<int, int> s(0, 0);
  for (register int i = 1; i <= n; ++i) {
    if (vis[i] != num || app[i].size() != 1) continue;
    (s.first ? s.second : s.first) = i;
  }
  if (!s.first) return 0;
  if (s.second &&
      seg[*app[s.first].begin()].size() < seg[*app[s.second].begin()].size())
    swap(s.first, s.second);
  if (s.second && seg[*app[s.first].begin()].size() == 2) {
    int w = *app[s.second].begin(), flag = 1;
    for (auto &v : seg[w])
      if (!app[v].size()) flag = 0;
    if (flag) {
      ans[m] = s.second, bel[m] = w;
      for (auto &v : seg[w]) app[v].erase(w);
      if (dfs(m - 1)) return 1;
      for (auto &v : seg[w]) app[v].insert(w);
    }
  }
  int w = *app[s.first].begin();
  for (auto &v : seg[w])
    if (!app[v].size()) return 0;
  ans[m] = s.first, bel[m] = w;
  for (auto &v : seg[w]) app[v].erase(w);
  if (dfs(m - 1)) return 1;
  for (auto &v : seg[w]) app[v].insert(w);
  return 0;
}
int main() {
  int x, y;
  read(t);
  while (t--) {
    read(n);
    for (register int i = 1; i < n; ++i) {
      read(x), seg[i].clear();
      while (x--) {
        read(y), seg[i].push_back(y);
        app[y].insert(i);
      }
    }
    dfs(n);
    for (register int i = 1; i <= n; ++i) printf("%d ", ans[i]);
    printf("\n");
  }
  return 0;
}
