#include <bits/stdc++.h>


using namespace std;

const int N = 20010;
map<int,int> arr[N];
bool vis[N];
int len[N];
int main()
{
    int T;
    scanf("%d",&T);
    while(T--) {
        int n,t,p;
        scanf("%d",&n);
        for(int i =0;i<n;i++) {
            arr[i].clear();
        }
        memset(vis,false,sizeof(vis));
        vis[0] = true;
        int maxT = 0;
        int minT = 110;
        for(int i=0;i<n;i++) {
            scanf("%d",&len[i]);
            for(int j = 0;j<len[i];j++) {
                scanf("%d %d",&t,&p);
                maxT = max(maxT,t);
                minT = min(minT,t);
                arr[i][t] = p;
            }
        }
        bool pos[11];
        for(int i=minT;i<=maxT;i++) {
            memset(pos,false,sizeof(pos));
            for(int j = 0;j<n;j++) {
                map<int,int>::iterator iter= arr[j].find(i);
                if(iter != arr[j].end()) {
                    if(vis[j]) {
                        pos[iter->second] = true;
                    }
                }
            }
            for(int j = 0;j<n;j++) {
                map<int,int>::iterator  iter= arr[j].find(i);
                if(iter != arr[j].end()) {
                    if(!vis[j] && pos[iter->second] == true){
                        vis[j] = true;
                    }
                }
            }
        }
        bool flag = false;
        for(int i=0;i<n;i++) {
            if(vis[i] == false) {
                continue;
            }
            if(flag) {
                printf(" ");
            }
            printf("%d",i+1);
            flag = true;
        }
        printf("\n");
    }
    return 0;
}