#include <bits/stdc++.h>
using namespace std;
using LL = long long;

void solve() {
    int n, m;
    cin >> n >> m;
    vector<vector<int>> op(n + 1);
    vector<int> ans(n + 1), last(m + 1), flag(n + 1);
    iota(ans.begin(), ans.end(), 0);

    for (int i = 1; i <= n; i++) {
        int sz;
        cin >> sz;
        for (int j = 0; j < sz; j++) {
            int x;
            cin >> x;
            op[i].push_back(x);
            last[x] = i;
        }
    }
    for (int i = 1; i <= n; i++) {
        for (auto x : op[i]) {
            if (x == i + 1) {
                flag[i] = 1;
            }
            if (i == x + 1) {
                flag[x] = 1;
            }
        }
    }
    bool ok = false;
    for (int i = 1; i + 1 <= n; i++) {
        if (!flag[i]) {
            swap(ans[i], ans[i + 1]);
            ok = true;
            break;
        }
    }

    if (ok) {
        cout << "Yes\n";
        for (int i = 1; i <= n; i++) {
            cout << ans[i] << " \n"[i == n];
        }
    } else {
        cout << "No\n";
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}