#include <vector>
#include <string>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <queue>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <fstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <ctime>
#include <iomanip>

using namespace std;

int main()
{
    int test,i1,n,i,j,t,p,k;
    short int len[20010],dis[20010],tt[110][11][210];//time place people
    bool b[20010],tmp;
    double ans;
    cin>>test;
    for (i1=1;i1<=test;i1++)
    {
        cin>>n;
        b[1]=true;
        for (i=2;i<=n;i++)
            b[i]=false;
        for (i=1;i<=100;i++)
            for (j=1;j<=10;j++)
            tt[i][j][0]=0;
        for (i=1;i<=n;i++)
        {
            scanf("%d",&len[i]);
            for (j=1;j<=len[i];j++)
            {
                scanf("%d%d",&t,&p);
                tt[t][p][0]++;
                tt[t][p][tt[t][p][0]]=i;
            }
        }
        for (i=1;i<=100;i++)//time
            for (j=1;j<=10;j++)//place
            {
                tmp=false;
                for (k=1;k<=tt[i][j][0];k++)
                    if (b[tt[i][j][k]]) tmp=true;
                if (tmp)
                    for (k=1;k<=tt[i][j][0];k++)
                        b[tt[i][j][k]]=true;
            }
        tmp=true;
        for (i=1;i<=n;i++)
            if (b[i])
                if (tmp) {printf("%d",i);tmp=false;}
                else printf(" %d",i);
        printf("\n");
    }
}