#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<bitset>
#define Fail puts("NO"),exit(0);
#define eps 1e-10
#define maxn 200010
#define maxm 100010
#define inf 1000000007
//#define mod 998244353
//#define inv 499122177
#define pi acos(-1)
#define G 3
#define pi acos(-1)
#define mp(x,y) make_pair(x,y)
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int>pii;
typedef bitset<maxn> bit;
typedef long double ld;
ll read()
{
    ll x=0,f=1;
    char ch=getchar();
    while(ch-'0'<0||ch-'0'>9){if(ch=='-') f=-1;ch=getchar();}
    while(ch-'0'>=0&&ch-'0'<=9){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
int T;
int n,top;
int a[maxn],res[maxn];
struct P{
    int id,t,p;
}p[maxn];
bool cmp(P a,P b)
{
    return a.t<b.t;
}
int vis[maxn];
int main()
{
    T=read();
    while(T--)
    {
        n=read();top=0;
        for(int i=1;i<=n;i++)
        {
            int x=read();
            while(x--)
            {
                ++top;
                p[top].id=i;
                p[top].t=read();
                p[top].p=read();
            }
        }
        for(int i=1;i<=n;i++)  res[i]=0;
        sort(p+1,p+top+1,cmp);
        res[1]=1;
        for(int i=1;i<=top;i++)
        {
            int R=i;
            while(R<top&&p[R+1].t==p[i].t)  R++;
            for(int j=1;j<=10;j++)  vis[j]=0;
            for(int j=i;j<=R;j++)  vis[p[j].p]|=res[p[j].id];
            for(int j=i;j<=R;j++)  res[p[j].id]|=vis[p[j].p];
            i=R;
        }
        int las;
        for(int i=1;i<=n;i++)
        {
            if(res[i])  las=i;
        }
        for(int i=1;i<=n;i++)
        {
            if(res[i])
            {
                if(i==las)  printf("%d\n",i);
                else        printf("%d ",i);
            }
        }
    }
    return 0;
}