//Δ_1003
#include<iostream>
#include<cstdio>
#include<fstream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<bitset>
#include<cmath>
#include<cstring>
#include<cstdlib>
using namespace std;
typedef long long LL;
typedef double DB;
const int N = 22222;
int n,t=100,p=10,a[N];
vector<int> v[111][11];
void go(vector<int>&vv){
    int l=vv.size(),i,x;
    x=0;
    for(i=0;i<l;i=i+1)
        x|=a[vv[i]];
    for(i=0;i<l;i=i+1)
        a[vv[i]]|=x;
}
int main()
{
    int T,i,j,l,x,y;
    scanf("%d",&T);
    while(T--){
        scanf("%d",&n);
        for(i=1;i<=n;i=i+1){
            scanf("%d",&l);
            for(j=1;j<=l;j=j+1){
                scanf("%d%d",&x,&y);
                v[x][y].push_back(i);
            }
        }
        a[1]=1;
        for(i=1;i<=t;i=i+1)
            for(j=1;j<=p;j=j+1)
                go(v[i][j]);
        x=0;
        for(i=1;i<=n;i=i+1){
            if(a[i]){
                if(x)
                    cout<<' ';
                cout<<i;
                x=1;
            }
        }
        cout<<endl;
        for(i=1;i<=t;i=i+1)
            for(j=1;j<=p;j=j+1)
                v[i][j].clear();
        for(i=1;i<=n;i=i+1)
            a[i]=0;
    }
    return 0;
}