#include <cstdio>
#include <iostream>
#include <cstring>
#include <queue>
#include <cmath>
#include <set>
#include <algorithm>
#include <map>
#include <vector>
#define mod 1000000007
using namespace std;
typedef long long ll;

const int N = 1e5+6;
const int inf = 0x3f3f3f3f;

vector<int> ve[106][16];
int vis[20006];

int main()
{
    int T, n, i, j, len, t, p;
    scanf("%d", &T);
    while(T--){
        scanf("%d", &n);
        int mt = 0, cnt = 0, flag = 1;
        vis[1] = 1;
        for(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(i = 1; i <= mt; ++i){
            for(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(vis[*it]){
                        for(vector<int>::iterator it = ve[i][j].begin(); it != ve[i][j].end(); ++it)
                            if(!vis[*it])
                                ++cnt, vis[*it] = 1;
                        break;
                    }
                }
                ve[i][j].clear();
                if(cnt == n)
                    break;
            }
            if(cnt == n)
                break;
        }
        for(i = 1; i <= n; ++i){
            if(vis[i]){
                if(flag)
                    printf("%d", i);
                else
                    printf(" %d", i);
                flag = 0;
                vis[i] = 0;
            }
        }
        printf("\n");
    }
    return 0;
}