#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;

const int MAXN = 20005;
int bad[MAXN];
int bq[MAXN], bc;

int main() {
  int nt, n;
  scanf("%d", &nt);
  while (nt--) {
    vector<int> per[103][13];
    memset(bad, 0, sizeof(bad));
    bad[1] = 1;
    scanf("%d", &n);
    for (int i = 1, t, p, len; i <= n; i ++) {
      scanf("%d", &len);
      while (len --) {
        scanf("%d%d", &t, &p);
        per[t][p].push_back(i);
      }
    }
    for (int t = 1; t <= 100; t ++) {
      for (int p = 1; p <= 10; p ++) {
        int gg = 0;
        for (auto i: per[t][p]) {
          if (bad[i]) {gg = 1; break;}
        }
        if (gg) {
          for (auto i: per[t][p]) bad[i] = 1;
        }
      }
    }
    bc = 0;
    for (int i = 1; i <= n; i ++) {
      if (bad[i]) bq[bc++] = i;
    }
    for (int i = 0; i < bc; i ++) {
      if (i == bc-1) printf("%d\n", bq[i]);
      else printf("%d ", bq[i]);
    }
  }
  return 0;
}