#include <stdio.h>
#include <string.h>
#include <algorithm>
#define MN 20000
#define MS 200000

int n,st[MN+5],len[MN+5];
bool vis[MN+5];

struct data{
    int t,p,id;
    bool operator < (const data &that)const{
        if(this->t != that.t) return this->t < that.t;
        return this->p < that.p;
    }
}d[MS+5];

void solve(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%d",&len[i]);
        st[i] = st[i-1] + len[i-1];
        for(int j=0;j<len[i];j++){
            scanf("%d%d",&d[st[i]+j].t,&d[st[i]+j].p);
            d[st[i]+j].id = i;
        }
    }
    int totlen = st[n]+len[n];
    std::sort(d,d+totlen);
    memset(vis,0,sizeof(vis));
    vis[1] = true;
    for(int i=0;i<totlen;i++){
        int l=i,r=i;
        while(r+1<totlen && (d[r+1].t==d[l].t && d[r+1].p==d[l].p)) r++;
        bool infected = false;
        for(int j=l;j<=r;j++)
            if(vis[d[j].id]){
                infected = true;
                break;
            }
        if(infected)
            for(int j=l;j<=r;j++)
                vis[d[j].id] = true;
        i=r;
    }
    bool stupidOJ = false;
    for(int i=1;i<=n;i++){
        if(vis[i]){
            if(stupidOJ){
                printf(" %d",i);
            }else{
                printf("%d",i);
                stupidOJ = true;
            }
        }
    }
    puts("");
}

int main(){
    int T; scanf("%d",&T);
    while(T--) solve();
}