#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

const int N = 1e5+6;

vector<int> ve[110][20];
int vist[20010];

int main()
{
    int T, n, t;
    int len, p;
    cin>>T;
    while(T--)
    {
        scanf("%d", &n);
        int mt = 0, res = 0, temp = 1;
        vist[1] = 1;
        for(int i = 1; i <= n; ++i)
        {
            scanf("%d", &len);
            while(len--)
            {
                scanf("%d%d", &t, &p);
                ve[t][p].push_back(i);
                if(mt < t)
                    mt = t;
            }
        }
        for(int i = 1; i <= mt; ++i)
        {
            for(int j = 1; j <= 10; ++j)
            {
                if(ve[i][j].size())
                for(vector<int>::iterator it = ve[i][j].begin(); it != ve[i][j].end(); ++it){
                    if(vist[*it])
                    {
                        for(vector<int>::iterator it = ve[i][j].begin(); it != ve[i][j].end(); ++it)
                            if(!vist[*it])
                                ++res, vist[*it] = 1;
                        break;
                    }
                }
                ve[i][j].clear();
                if(res == n)
                    break;
            }
            if(res == n)
                break;
        }
        for(int i = 1; i <= n; ++i){
            if(vist[i]){
                if(temp)
                    printf("%d", i);
                else
                    printf(" %d", i);
                temp = 0;
                vist[i] = 0;
            }
        }
        printf("\n");
    }
    return 0;
}