#include <bits/stdc++.h>
using namespace std;
int n, f[20005];
vector <int> a[103][13];
void solve() {
    memset(f, 0, sizeof f);
    f[1] = 1;
    for (int i = 1; i <= 100; i++)
        for (int j = 1; j <= 10; j++)
            a[i][j].clear();
    
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
        int q;
        scanf("%d", &q);
        while (q--) {
            int t, p;
            scanf("%d %d", &t, &p);
            a[t][p].push_back(i);
        }
    }
    
    for (int i = 1; i <= 100; i++)
        for (int j = 1; j <= 10; j++) {
            int g = 0;
            for (int k = 0; k < (int)a[i][j].size(); k++)
                g |= f[a[i][j][k]];
            if (!g) continue;
            for (int k = 0; k < (int)a[i][j].size(); k++)
                f[a[i][j][k]] = 1;
        }
    
    int fir = 1;
    for (int i = 1; i <= n; i++)
        if (f[i]) {
            if (fir) fir = 0;
            else putchar(' ');
            printf("%d", i);
        }
    printf("\n");
}
int main() {
    int T;
    cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}