#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
template <typename T>
void view(T e) {
  std::cerr << e << std::endl;
}
template <typename T>
void view(const std::vector<T> &v) {
  for (const auto &e : v) {
    std::cerr << e << " ";
  }
  std::cerr << std::endl;
}
template <typename T>
void view(const std::vector<std::vector<T>> &vv) {
  cerr << endl;
  int cnt = 0;
  for (const auto &v : vv) {
    cerr << cnt << "th : ";
    view(v);
    cnt++;
  }
  cerr << endl;
}
std::ostream &operator<<(std::ostream &dest, __int128_t value) {
  std::ostream::sentry s(dest);
  if (s) {
    __uint128_t tmp = value < 0 ? -value : value;
    char buffer[128];
    char *d = std::end(buffer);
    do {
      --d;
      *d = "0123456789"[tmp % 10];
      tmp /= 10;
    } while (tmp != 0);
    if (value < 0) {
      --d;
      *d = '-';
    }
    int len = std::end(buffer) - d;
    if (dest.rdbuf()->sputn(d, len) != len) {
      dest.setstate(std::ios_base::badbit);
    }
  }
  return dest;
}
const ll mod = 1000000007;
const int inf = 1001001001;
const ll INF = 1001001001001001001ll;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
template <class T>
bool chmax(T &a, const T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T &a, const T b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
ll rudiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); }
ll rddiv(ll a, ll b) { return a / b - ((a ^ b) < 0 && a % b); }
ll power(ll a, ll p) {
  ll ret = 1;
  while (p) {
    if (p & 1) {
      ret = ret * a;
    }
    a = a * a;
    p >>= 1;
  }
  return ret;
}
ll modpow(ll a, ll p) {
  ll ret = 1;
  while (p) {
    if (p & 1) {
      ret = ret * a % mod;
    }
    a = a * a % mod;
    p >>= 1;
  }
  return ret;
}
int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    V<set<int>> a(n - 1), tmp;
    for (int i = 0; i < n - 1; i++) {
      int k;
      cin >> k;
      for (int j = 0; j < k; j++) {
        int b;
        cin >> b;
        a[i].insert(b);
      }
    }
    for (int st = 1; st <= n; st++) {
      V<int> ans(1, st);
      tmp = a;
      for (int i = 0; i < n - 1; i++) tmp[i].erase(st);
      for (int i = 0; i < n - 1; i++) {
        int nxt = -1;
        for (int j = 0; j < n - 1; j++) {
          if (tmp[j].size() == 1) {
            nxt = *tmp[j].begin();
          }
        }
        if (nxt == -1) break;
        for (int j = 0; j < n - 1; j++)
          if (tmp[j].count(nxt)) tmp[j].erase(nxt);
        ans.push_back(nxt);
      }
      if (ans.size() != n) continue;
      do {
        std::cerr << "ans"
                  << " : ";
        view(ans);
      } while (0);
      tmp = a;
      bool ok = true;
      for (int i = 0; i < n - 1; i++) {
        for (int j = 0; j < n; j++) {
          if (tmp[i].count(ans[j])) {
            if (tmp[i].size() + j - 1 >= n)
              goto cont;
            else {
              for (int ii = j; ii <= j + ((int)(tmp[i]).size()) - 1; ii++) {
                if (tmp[i].count(ans[ii])) continue;
                goto cont;
              }
            }
            break;
          }
        }
      }
      for (int i = 0; i < n; i++) cout << ans[i] << " ";
      cout << endl;
      break;
    cont:
      continue;
    }
  }
}
