#include<bits/stdc++.h>

using namespace std;

#define int long long

using i64 = long long;
using i32 = int32_t;
using vi = vector<int>;
using pii = pair<int, int>;

const int N = 1e4 + 5;

void solve() {
    int n, m;
    cin >> n >> m;
    vi lst(m + 1), inDeg(n + 1);
    vector<vi> e(n + 1);
    for (int i = 1, p; i <= n; i++) {
        cin >> p;
        for (int x; p; p--) {
            cin >> x;
            if (lst[x] != 0 and lst[x] != i ) {
                inDeg[i]++;
                e[lst[x]].push_back(i);
            }
            lst[x] = i;
        }
    }
    priority_queue<int> q;
    for (int i = 1; i <= n; i++)
        if (inDeg[i] == 0) q.push(i);
    vi res;
    for (int u; not q.empty();) {
        u = q.top(), q.pop();
        res.push_back(u);
        for (auto v: e[u]) {
            if (--inDeg[v] == 0) res.push_back(v);
        }
    }
    if (res.size() != n and is_sorted(res.begin(), res.end())) {
        cout << "No\n";
    } else {
        cout << "Yes\n";
        for (auto i: res)
            cout << i << " \n"[i == res.back()];
    }
    return;
}

i32 main() {
    ios::sync_with_stdio(false), cin.tie(nullptr);
    i32 TC;
    for (cin >> TC; TC; TC--)
        solve();
    return 0;
}