#include <bits/stdc++.h>

#define endl "\n"

using namespace std;
using LL = long long;
using PII = pair<int, int>;

const int N = 2e6 + 10;

int idx;
int deg[N];
vector<int> G[N], H[N];
int ans[N], a[N];

void solve() {
    int n, m;
    cin >> n >> m;
    for (int i = 0; i <= max(n, m) + 10; i++)
        H[i].clear(), G[i].clear(), deg[i] = 0;
    idx = 0;
    for (int i = 1; i <= n; i++) {
        int x;
        cin >> x;
        for (int j = 1; j <= x; j++) {
            int u;
            cin >> u;
            G[u].push_back(i);
        }
    }
    for (int i = 1; i <= m; i++) {
        if (G[i].empty())
            continue;
        int lst = G[i].back();
        for (auto v : G[i]) {
            if (v != lst) {
                H[v].push_back(lst);
                deg[lst]++;
            }
        }
    }
    priority_queue<int> q;
    for (int i = 1; i <= n; i++)
        if (!deg[i])
            q.push(i);
    while (!q.empty()) {
        int u = q.top();
        q.pop();
        ans[++idx] = u;
        for (auto v : H[u]) {
            deg[v]--;
            if (!deg[v])
                q.push(v);
        }
    }
    for (int i = 1; i <= n; i++) {
        if (ans[i] == i) {
            cout << "No\n";
            return;
        }
    }
    assert(idx == n);
    cout << "Yes\n";
    for (int i = 1; i <= n; i++)
        cout << ans[i] << " ";
    cout << endl;
}

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

    int tt; // read(tt);
    cin >> tt;
    while (tt--) {
        solve();
    }

    return 0;
}