#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e4+5;
bool vis[maxn]; int len [maxn];
vector<pair<int,int>> mp[maxn];
int T,n,u,v;
int main (){
    ios::sync_with_stdio(false);
    //freopen("in.txt","r",stdin);
    cin >> T;
    while (T--){
        set<int> se[105][12];
        cin >> n;
        memset(vis,0,sizeof(vis));
        memset(len,0,sizeof(len));
        for (int i=0; i<n; i++) mp[i].clear();
        for (int i=0; i<n; i++){
            cin >> len[i];
            for (int j=0; j<len[i]; j++){
                cin >> u >> v;
                se[u][v].insert(i);
                mp[i].push_back(make_pair(u,v));
            }
        }
        vis[0] = true;
        priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > > que;
        for (int i=0; i<len[0]; i++){
            que.push(mp[0][i]);
        }
        while (!que.empty()){
            pair <int,int> p = que.top(); que.pop();
            //cout << p.first << ' ' << p.second << endl;
            for (auto &s : se[p.first][p.second]){
                if (vis[s]) continue;
                vis[s] = 1;
                for (int i=0; i<len[s]; i++)
                    if (mp[s][i].first > p.first)
                        que.push(mp[s][i]);
            }
        }
        cout << 1;
        for (int i=1; i<n; i++)
            if (vis[i]==true)
                cout << ' ' << i+1;
        cout << '\n';
    }
    return 0;
}