#include <bits/stdc++.h>

using namespace std;

#define N 200007
#define INF 0x3f3f3f3f
#define LL long long

vector<int> v[101][11];

bool check[20001];

int main()
{
    int T;
    scanf("%d", &T);
    while (T--)
    {
        int n, L, t, p;
        scanf("%d", &n);
        for (int i = 1; i <= 100; i++)
        {
            for (int j = 1; j <= 10; j++)
            {
                v[i][j].clear();
            }
        }
        memset(check, false, sizeof(check));
        check[1] = true;
        for (int i = 1; i <= n; i++)
        {
            scanf("%d", &L);
            for (int  j = 0; j < L; j++)
            {
                scanf("%d%d", &t, &p);
                v[t][p].push_back(i);
            }
        }
        for (t = 1; t <= 100; t++)
        {
            for (p = 1; p <= 10; p++)
            {
                L = v[t][p].size();
                bool ok = false;
                for (int i = 0; i < L; i++)
                {
                    if (check[v[t][p][i]])
                    {
                        ok = true;
                        break;
                    }
                }
                if (!ok) continue;
                for (int i = 0; i < L; i++)
                {
                    check[v[t][p][i]] = true;
                }
            }
        }
        printf("1");
        for (int i = 2; i <= n; i++) if (check[i]) printf(" %d", i);
        printf("\n");
    }
    return 0;
}