#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <iomanip>
#include <cmath>
#include <complex>

using namespace std;

void solve() {
    int n, m;
    cin >> n >> m;
    vector <int> v(m, 0), grad(n, 0), ans;
    vector <vector <int>> op(n);
    vector <vector <int>> G(n);
    deque <int> dq;
    for (int i = 0; i < n; i++) {
        int k;
        cin >> k;
        op[i].resize(k);
        for (int j = 0; j < k; j++) {
            cin >> op[i][j];
            op[i][j]--;
            v[op[i][j]] = i;
        }
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < (int) op[i].size(); j++) {
            if (v[op[i][j]] != i) {
                G[i].push_back(v[op[i][j]]);
                grad[v[op[i][j]]]++;
            }
        }
    }
    for (int i = 0; i < n; i++) {
        if (grad[i] == 0) {
            dq.push_back(i);
        }
    }
    bool ok = 0;
    while (!dq.empty()) {
        if (dq.front() != dq.back()) {
            ok = 1;
        }
        int curr = max(dq.front(), dq.back());
        if (dq.front() == curr) {
            dq.pop_front();
        }
        else {
            dq.pop_back();
        }
        ans.push_back(curr);
        for(int vecin : G[curr])
        {
            grad[vecin]--;
            if(grad[vecin] == 0)
                dq.push_back(vecin);
        }
    }
    if (ok) {
        cout << "YES\n";
        for (int i = 0; i < n; i++) {
            cout << ans[i] + 1 << ' ';
        }
        cout << '\n';
    }
    else {
        cout << "NO\n";
    }
}

int main() {
#ifdef LOCAL
    freopen("test.in", "r", stdin);
    freopen("test.out", "w", stdout);
#endif // LOCAL
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int nrTeste;
    cin >> nrTeste;
    while (nrTeste--) {
        solve();
    }
    return 0;
}