#include<bits/stdc++.h>
#define ll long long
using namespace std;
int T,n,cnt,len,t,p;
struct node{
    int a,b,c;
}d[200005];
int is[200005];

int read(){
    int x=0;char ch=getchar();
    while(!isdigit(ch)) ch=getchar();
    while(isdigit(ch)) x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
    return x;
}

void print(ll x){
    if(x>=10) print(x/10);
    putchar(x%10+'0');
}

int cmp(node u,node v){
    return u.a<v.a||(u.a==v.a&&u.b<v.b);
}

int main(){
    T=read();
    while(T--){
        memset(is,0,sizeof(is));
        n=read(),cnt=0;
        for(int i=1;i<=n;i++){
            len=read();
            for(int j=1;j<=len;j++){
                t=read(),p=read();
                d[++cnt]=(node){t,p,i}; 
            }
        }
        sort(d+1,d+cnt+1,cmp);
        is[1]=1;
        for(int l=1,r;l<=cnt;l=r+1){
            r=l;
            while(r+1<=cnt&&d[r+1].a==d[l].a&&d[r+1].b==d[l].b) r++;
            int fuck=0;
            for(int j=l;j<=r;j++) fuck|=is[d[j].c];
            for(int j=l;j<=r;j++) is[d[j].c]|=fuck;
        }
        int di=0;
        for(int i=1;i<=n;i++){
            if(is[i]){
                if(di) putchar(' ');
                print(i),di=1;
            }
        }
        puts("");
    }

    return 0;
}