import java.io.*;
import java.math.BigDecimal;
import java.util.*;

public class Main {
    public static void main(String[] args) throws IOException {
        PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
        FastScanner in=new FastScanner();
        int T = in.nextInt();
        while (T-->0){
            int n=in.nextInt();
            Map<Integer,Integer>[] trace = new HashMap[n+1];
            Map<Integer,Map<Integer,List<Integer>>> map=new HashMap<>();
            for(int i=1;i<=n;i++)
            {
                int num = in.nextInt();
                trace[i]=new HashMap<Integer,Integer>();
                for(int j=0;j<num;j++) {
                    int t=in.nextInt();
                    int  p =in.nextInt();
                    trace[i].put(t,p);
                    Map<Integer, List<Integer>> umap = map.get(t);
                    if(umap==null) {
                        umap=new HashMap<>();
                        map.put(t,umap);
                    }
                    List<Integer> list = umap.get(p);
                    if(list==null){
                        list=new ArrayList<>();
                        umap.put(p,list);
                    }
                    list.add(i);
                }
            }
            boolean []flag=new boolean[n+1];
            Integer []time=new Integer[n+1];
            flag[1]=true;time[1]=1;
            Queue<Integer[]> queue=new PriorityQueue<>(new Comparator<Integer[]>() {
                @Override
                public int compare(Integer[] o1, Integer[] o2) {
                    return o1[1]-o2[1];
                }
            });
            queue.add(new Integer[]{1,0});
            while (queue.size()>0){
                Integer[] poll = queue.poll();
                if(trace[poll[0]]==null) continue;;
                if(flag[poll[0]]&&time[poll[0]]<poll[1]) continue;
                for(int t:trace[poll[0]].keySet())
                {
                    if(t<time[poll[0]]) continue;
                    Integer p = trace[poll[0]].get(t);
                    List<Integer> list = map.get(t).get(p);
                    for(int user:list)
                        if(!flag[user]||t<time[user]){
                            queue.add(new Integer[]{user,t});
                            flag[user]=true;
                            time[user]=t;
                        }
                }
            }
            StringBuilder res=new StringBuilder();
            for(int i=1;i<=n;i++){
                if(flag[i])
                   res.append(i+" ");
            }
             out.println(res.substring(0,res.length()-1));
        }
        out.flush();
    }
    static class FastScanner {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st=new StringTokenizer("");
        String next() {
            while (!st.hasMoreTokens())
                try {
                    st=new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }
        int[] readArray(int n) {
            int[] a=new int[n];
            for (int i=0; i<n; i++) a[i]=nextInt();
            return a;
        }
        long nextLong() {
            return Long.parseLong(next());
        }
    }
}