#include <bits/stdc++.h>
using namespace std;
vector < int > id[1010];
int n, ans[20010];
int main() {
    int T;
    scanf("%d", &T);
    while (T--) {
        scanf("%d", &n);
        for (int i = 1; i <= 1000; i++) id[i].clear();
        for (int i = 1; i <= n; i++) {
            int len;
            scanf("%d", &len);
            while (len--) {
                int t, p;
                scanf("%d%d", &t, &p);
                id[(t - 1) * 10 + p].push_back(i);
            }
        }
        memset(ans, 0, sizeof ans);
        ans[1] = 1;
        for (int i = 1; i <= 1000; i++) {
            int tag = 0;
            for (int j = 0; j < id[i].size(); j++) tag |= ans[id[i][j]];
            for (int j = 0; j < id[i].size(); j++) ans[id[i][j]] |= tag;
        }
        printf("1");
        for (int i = 2; i <= n; i++) if (ans[i]) printf(" %d", i);
        puts("");
    }
}