#include<bits/stdc++.h>

using namespace std;
using ll = long long;

void solve() {
    int n, m;
    cin >> n >> m;
    vector<int> pos(m + 1);
    vector<vector<int>> g(n + 1);
    vector<int> in(n + 1), p(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> p[i];
        for (int j = 0; j < p[i]; j++) {
            int x;
            cin >> x;
            if (pos[x]) {
                g[pos[x]].emplace_back(i);
                in[i]++;
            }
            pos[x] = i;
        }
    }
    priority_queue<int> que;
    for (int i = 1; i <= n; i++) {
        if (!in[i]) {
            que.emplace(i);
        }
    }
    vector<int> ans;
    while (!que.empty()) {
        int k = que.top();
        que.pop();
        ans.emplace_back(k);
        for (auto v: g[k]) {
            in[v]--;
            if (!in[v]) {
                que.emplace(v);
            }
        }
    }
    if (ans.size() != n) {
        cout << "No\n";
        return;
    }
    int ok = 0;
    for (int i = 0; i < n; i++) {
        if (ans[i] != i + 1) {
            ok = 1;
            break;
        }
    }
    if (!ok) {
        cout << "No\n";
        return;
    }
    cout << "Yes\n";
    for (int i = 0; i < n; i++) {
        cout << ans[i] << " \n"[i + 1 == n];
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int _ = 1;
    cin >> _;
    for (; _; _--)solve();
    return 0;
}