#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long powmod(long long a, long long b, long long MOD) {
  if (a == 0ll) {
    return 0ll;
  }
  a %= MOD;
  long long ans = 1;
  while (b) {
    if (b & 1) {
      ans = ans * a % MOD;
    }
    a = a * a % MOD;
    b >>= 1;
  }
  return ans;
}
long long poww(long long a, long long b) {
  if (a == 0ll) {
    return 0ll;
  }
  long long ans = 1;
  while (b) {
    if (b & 1) {
      ans = ans * a;
    }
    a = a * a;
    b >>= 1;
  }
  return ans;
}
void Pv(const vector<int> &V) {
  int Len = int(V.size());
  for (int i = 0; i < Len; ++i) {
    printf("%d", V[i]);
    if (i != Len - 1) {
      printf(" ");
    } else {
      printf("\n");
    }
  }
}
void Pvl(const vector<long long> &V) {
  int Len = int(V.size());
  for (int i = 0; i < Len; ++i) {
    printf("%lld", V[i]);
    if (i != Len - 1) {
      printf(" ");
    } else {
      printf("\n");
    }
  }
}
inline long long readll() {
  long long tmp = 0, fh = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') fh = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') tmp = tmp * 10 + c - 48, c = getchar();
  return tmp * fh;
}
inline int readint() {
  int tmp = 0, fh = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') fh = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') tmp = tmp * 10 + c - 48, c = getchar();
  return tmp * fh;
}
void pvarr_int(int *arr, int n, int strat = 1) {
  if (strat == 0) {
    n--;
  }
  for (int i = strat; i <= n; i++) {
    printf("%d%c", arr[i], i == n ? '\n' : ' ');
  }
}
void pvarr_LL(long long *arr, int n, int strat = 1) {
  if (strat == 0) {
    n--;
  }
  for (int i = strat; i <= n; i++) {
    printf("%lld%c", arr[i], i == n ? '\n' : ' ');
  }
}
const int maxn = 1000010;
const int inf = 0x3f3f3f3f;
int n;
int main() {
  int t;
  t = readint();
  while (t--) {
    n = readint();
    std::vector<set<int>> v;
    for (int i = 2; i <= n; i++) {
      set<int> now;
      now.clear();
      int k = readint();
      int x;
      for (int j = 1; j <= k; j++) {
        x = readint();
        now.insert(x);
      }
      v.push_back(now);
    }
    std::vector<int> ans;
    for (int fst = 1; fst <= n; fst++) {
      ans.clear();
      std::vector<set<int>> temp = v;
      for (auto &now : temp) {
        if (now.count(fst)) {
          now.erase(fst);
        }
      }
      int ok = 1;
      int cnt = 0;
      int nxt;
      ans.push_back(fst);
      for (int i = 2; i <= n; i++) {
        cnt = 0;
        for (auto &now : temp) {
          if (now.size() == 1) {
            cnt++;
            nxt = *(now.begin());
          }
        }
        if (cnt != 1) {
          ok = 0;
          break;
        } else {
          ans.push_back(nxt);
          for (auto &now : temp) {
            if (now.count(nxt)) {
              now.erase(nxt);
            }
          }
        }
      }
      if (ok) {
        set<set<int>> info((v).begin(), (v).end());
        for (int i = 1; i <= n - 1; i++) {
          set<int> st;
          st.clear();
          bool found = 0;
          for (int j = i; j >= 0; --j) {
            st.insert(ans[j]);
            if (info.count(st)) {
              info.erase(st);
              found = 1;
              break;
            }
          }
          if (!found) {
            ok = 0;
            break;
          }
        }
      }
      if (ok) {
        Pv(ans);
        break;
      }
    }
  }
  return 0;
}
