#include<bits/stdc++.h>

using namespace std;

using ll = long long;

void solve() {
    int n, m;
    cin >> n >> m;
    vector<vector<int>> q(n + 1);
    for (int i = 1; i <= n; i++) {
        int x;
        cin >> x;
        q[i].push_back(x);
        for (int j = 1; j <= q[i][0]; j++) {
            cin >> x;
            q[i].push_back(x);
        }
    }
    vector<int> is(m + 1, 0);
    for (int i = n; i >= 2; i--) {
        map<int, int> a, b;
        for (int j = 1; j <= q[i - 1][0]; j++) {
            if (!is[q[i - 1][j]]) a[q[i - 1][j]] = j;
        }
        for (int j = 1; j <= q[i][0]; j++) {
            if (!is[q[i][j]]) a[q[i][j]] = j;
        }
        for (int j = 1; j <= q[i][0]; j++) {
            if (!is[q[i][j]]) b[q[i][j]] = j;
        }
        for (int j = 1; j <= q[i - 1][0]; j++) {
            if (!is[q[i - 1][j]])  b[q[i - 1][j]] = j;
        }
        for (auto [x, y] : a) {
            if (b[x] != y && b[x] != 0) goto G;
        }
        if (1) {
            cout << "Yes\n";
            for (int j = 1; j <= n; j++) {
                if (j == i) {
                    cout << i - 1 << " ";
                } else if (j == i - 1) {
                    cout << i << " ";
                } else {
                    cout << j << " ";
                }
            }
cout << "\n";
            return;
        }
        G:;
        for (int j = 1; j <= q[i][0]; j++) {
            is[q[i][j]] = 1;
        }
    }
    cout << "No\n";

}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}