#include<stdlib.h>
#include<stdio.h>
#include<string.h>
#include<limits.h>
#include<string> 
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
#define ll long long
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll qpow(ll a,ll b,ll mod=1e18+7){ll ans=1;while(b){if(b&1)ans=ans*a%mod;a=a*a%mod;b=b>>1;}return ans;}
bool isPrime(ll x){if(x==2)return true;for(ll i=2;i*i<=x;++i)if(x%i==0)return false;return x>1;}
bool vis[20002];
int main(){
    int t;
    cin>>t;
    while(t--){
        memset(vis,false,sizeof vis);
        vis[1]=1;
        ll n;
        scanf("%lld",&n);
        vector<vector<vector<int> > > day(101,vector<vector<int> >(101));
        for(int i=1;i<=n;++i){
            ll temp;
            scanf("%lld",&temp);
            vector<pair<int,int> > len(temp);
            for(int j=0;j<temp;++j){
                int t,l;
                scanf("%d %d",&t,&l);
                day[t][l].push_back(i);
            }
        }
        for(int i=0;i<day.size();++i){
            for(int j=0;j<day[i].size();++j){
                bool flag=false;
                for(int k=0;k<day[i][j].size();k++){
                    int cur=day[i][j][k];
                    if(vis[cur]==true){
                        flag=true;
                    }
                }
                if(flag){
                    for(int k=0;k<day[i][j].size();k++){
                        int cur=day[i][j][k];
                        vis[cur]=true;
                    } 
                }
            }
        }
        int cnt=0;
        for(int i=1;i<=n;++i){
            if(cnt&&vis[i])  printf(" ");
            if(vis[i]){
                printf("%d",i);
                cnt++;
            } 
        }
        printf("\n");
    }
    return 0;
}