#include <bits/stdc++.h>
#define ls rt<<1
#define rs rt<<1|1
using namespace std;

typedef  long long ll;
const int inf = 0x3f3f3f3f;
const int maxn = 1000001;

int vis[20100];
struct node {
    int id, t, p;
    friend bool operator<(node s1, node s2) {
        if(s1.t == s2.t) return s1.p < s2.p;
        return s1.t < s2.t;
    }
} q[201000];
int main() {
    int t;
    scanf("%d", &t);
    while(t--) {
        int n, op = 0;
        scanf("%d", &n);
        for(int i = 1; i <= n; i++) {
            vis[i] = 0;
            int k;
            scanf("%d", &k);
            for(; k; k--) {
                int t, p;
                scanf("%d%d", &t, &p);
                op++;
                q[op].id = i, q[op].t = t, q[op].p = p;
            }
        }

        vis[1] = 1;
        sort(q + 1, q + 1 + op);
//        for(int i = 1; i <= op; i++) cout << q[i].id << "qaq" << q[i].t << "qaq" << q[i].p << endl;
        for(int l = 1; l <= op; l++) {
            int r = l;
            while(r + 1 <= op && q[r + 1].t == q[l].t && q[r + 1].p == q[l].p) r++;
            int ok = 0;
            for(int j = l; j <= r; j++) {
//                cout << q[j].id << "===";
                if(vis[q[j].id] == 1) ok = 1;
            }
//            cout << endl;
            if(ok) {
                for(int j = l; j <= r; j++) vis[q[j].id] = 1;
            }
//            cout<<l<<" "<<r<<endl;
            l = r;
        }
        printf("1");
        for(int i = 2; i <= n; i++) if(vis[i]) printf(" %d", i);
        printf("\n");
    }
}