#include<bits/stdc++.h>
#define fo(i,a,b) for(int i=a;i<=b;++i)
#define fod(i,a,b) for(int i=a;i>=b;--i)
#define max(q,w) ((q)>(w)?(q):(w))
#define min(q,w) ((q)<(w)?(q):(w))
using namespace std;
typedef long long LL;
const int N=200500,INF=1e9;
int read(int &n)
{
    int q=1;n=0;char ch=' ';
    for(;ch!='-'&&(ch<'0'||ch>'9');ch=getchar());
    if(ch=='-')q=-1,ch=getchar();
    for(;ch<='9'&&ch>='0';ch=getchar())n=(n<<1)+(n<<3)+ch-48;
    return n;
}
int n,m;
int a[N][3];
int p[N],z[N];
LL ans;
bool PX(int q,int w){return a[q][0]<a[w][0]||(a[q][0]==a[w][0]&&a[q][1]<a[w][1]);}
int main()
{
    int q,w,_;
    read(_);
    while(_--)
    {
        read(n);
        m=0;
        fo(i,1,n)
        {
            read(q);
            fo(j,1,q)
            {
                ++m;
                p[m]=m;
                read(a[m][0]),read(a[m][1]),a[m][2]=i;
            }
        }
        sort(p+1,p+1+m,PX);
        z[1]=1;fo(i,2,n)z[i]=0;
        fo(i,1,m)
        {
            q=i;
            for(;i<=m&&a[p[i+1]][0]==a[p[i]][0]&&a[p[i+1]][1]==a[p[i]][1];++i);
            w=0;
            fo(j,q,i)if(z[a[p[j]][2]])w=1;
            if(w)fo(j,q,i)z[a[p[j]][2]]=1;
        }
        fod(i,n,1)if(z[i]){q=i;break;}
        fo(i,1,n)if(z[i])
        {
            printf("%d",i);
            if(i<q)printf(" ");
        }
        // if(_)
            printf("\n");
    }
    return 0;
}