#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <set>

using namespace std;

int main() {
    int cas;
    cin >> cas;
    int ti = 0;
    int pi = 0;
    while (cas--) {
        int n;
        cin >> n;
        vector< vector< vector<int> > > co(105, vector< vector<int> >(12, vector<int>()));
        set<int> sick = { 1 };
        for (int i = 0; i < n; i++) {
            int l;
            cin >> l;
            for (int j = 1; j <= l; j++) {
                int t, p;
                cin >> t >> p;
                ti = max(ti, t);
                pi = max(pi, p);
                co[t][p].push_back(i + 1);
            }
        }
        for (int i = 1; i <= ti; i++) {
            for (int j = 1; j <= pi; j++) {
                for (int k : co[i][j]) {
                    if (sick.count(k) != 0) {
                        for (int kk : co[i][j]) {
                            sick.insert(kk);
                        }
                        break;
                    }
                }
            }
        }
        vector<int> res;
        for (int i : sick) {
            res.push_back(i);
        }
        int mm = (int)res.size();
        for (int i = 0; i < mm - 1; i++)
            cout << res[i] << " ";
        cout << res[mm - 1] << endl;
    }
    return 0;
}