#include <bits/stdc++.h>

using namespace std;

void solve() {
    int n, m;
    cin >> n >> m;
    vector<int> now(m + 1), ind(n + 1);
    vector<set<int, greater<int>>> to(n + 1);
    for (int i = 1; i <= n; i++) {
        int p;
        cin >> p;
        for (int j = 1; j <= p; j++) {
            int x;
            cin >> x;
            if (now[x] && to[now[x]].find(i) == to[now[x]].end()) {
                to[now[x]].insert(i);
                ind[i]++;
            }
            now[x] = i;
        }
    }
    vector<int> ans;
    queue<int> q;
    for (int i = n; i >= 1; i--) {
        if (ind[i] == 0) {
            q.push(i);
        }
    }
    while (!q.empty()) {
        int now = q.front();
        q.pop();
        ans.push_back(now);
        for (auto it : to[now]) {
            ind[it]--;
            if (ind[it] == 0) {
                q.push(it);
            }
        }
    }
    bool check = 0;
    for (int i = 0; i < n; i++) {
        if (ans[i] != i + 1) {
            check = 1;
            break;
        }
    }
    if (check) {
        cout << "Yes\n";
        for (int i = 0; i < n; i++) {
            cout << ans[i] << " \n"[i + 1 == n];
        }
    } else
        cout << "No\n";
    return;
}
int main() {
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}