//#include <bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
//#include <unordered_map>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define deg(x) cout<< #x"=" << (x) << endl;
#define degg(x,y) cout<< #x"="<< (x) <<","<< #y"="<< (y) <<endl;
#define deggg(x,y,z) cout<<#x"="<<(x)<<","<<#y"="<<(y)<<","<<#z"="<<(z)<<endl;
#define sca(x) scanf("%d",&x)
#define scaa(x,y) scanf("%d%d",&x,&y)
#define scaaa(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define pch(x) putchar(x)
#define ptf(x) printf("%d\n",x)
#define ptff(x,y) printf("%d %d\n",x,y)
#define ptfff(x,y,z) printf("%d %d %d\n",x,y,z)
#define space(x) printf("%d ",x)
#define mes(a,x) memset(a,x,sizeof(a))
#define PI acos(-1)
#define lowbit(x) x&-x
#define ALL(X) (X).begin(), (X).end()
#define PB push_back
#define MP make_pair
#define ls rt<<1
#define rs rt<<1|1
#define ac(t) cout<<(t)<<endl
using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef priority_queue<int,vector<int>,greater<int> > xqueue;
typedef priority_queue<int> dqueue;
//typedef tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update> x_rb;
//typedef tree<int,null_type,greater_equal<int>,rb_tree_tag,tree_order_statistics_node_update> d_rb;

const ll INF=9e18;
const int inf=2147483647;

ll qpow(ll a,ll b,ll mod) {
    ll r=1;
    for(; b; b>>=1) {
        if(b&1)
            r=(r*a)%mod;
        a=(a*a)%mod;
    }
    return r;
}

const int N=2e4+5;
int pos[N][105];
vector<int> yes,w[105][15];
set<int> no;

void work() {
    //IOS;
    int t;
    sca(t);
    while(t--) {
        int n;
        sca(n);
        int mx=-1;
        mes(pos,0);
        no.clear();
        for(int i=0;i<105;i++) {
            for(int j=0;j<15;j++) w[i][j].clear();
        }
        for(int i=1;i<=n;i++) {
            int m;
            sca(m);
            while(m--) {
                int tp,p;
                scaa(tp,p);
                w[tp][p].PB(i);
                pos[i][tp]=p;
                mx=max(mx,tp);
            }
            if(i>1) no.insert(i);
        }
        yes.clear();
        yes.PB(1);
        for(int i=1;i<=mx;i++) {
            int m=yes.size();
            for(int j=0;j<m;j++) {
                int have=yes[j];
                if(pos[have][i]) {//deggg(have,i,pos[have][i])
                    for(auto &people:w[i][pos[have][i]]) {
                        if(no.count(people)) {
                            no.erase(people);
                            yes.PB(people);
                            m++;
                        }
                    }
                }
            }
        }
        sort(ALL(yes));
        for(int i=0;i<yes.size();i++) {
            if(i) printf(" %d",yes[i]);
            else printf("%d",yes[i]);
        }
        puts("");
    }
}

int main() {
#ifdef Local
    freopen("1.txt","r",stdin);
#endif // mm
    work();
    return 0;
}