#include <bits/stdc++.h>
using namespace std;
const int maxn = 20020;
int vis[maxn], ans[maxn];
vector <int> e[1010];

int main(void) {
    //freopen("c.in","r",stdin);
    int T; scanf("%d",&T);
    while (T--) {
        for (int i=0;i<1000;i++) e[i].clear();
        int n; scanf("%d",&n);
        for (int i=1;i<=n;i++) {
            int m; scanf("%d",&m);
            for (int j=0;j<m;j++) {
                int t,p; scanf("%d%d",&t,&p);
                e[(t-1)*10+(p-1)].push_back(i);
            }
        }
        vis[1]=1; for (int i=2;i<=n;i++) vis[i]=0;
        for (int i=0;i<1000;i++) {
            int f=0;
            for (int j=0;j<e[i].size();j++) if (vis[e[i][j]]) {f=1;break;}
            if (f == 1) {
                for (int j=0;j<e[i].size();j++) vis[e[i][j]]=1;
            }
        }
        int tot=0;
        for (int i=1;i<=n;i++) if (vis[i]) ans[tot++]=i;
        for (int i=0;i<tot;i++) printf("%d%c",ans[i]," \n"[i==tot-1]);
    }
    return 0;
}