#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;
        }
    }
    for (int i = 1; i < n; i++) {
        if (to[i].find(i + 1) != to[i].end()) {
            cout << "Yes\n";
            for (int j = 1; j <= n; j++) {
                if (j == i + 1) {
                    cout << i << " \n"[j == n];
                } else if (j == i) {
                    cout << i + 1 << " ";
                } else
                    cout << j << " \n"[j == n];
            }
            return;
        }
    }
    cout << "No\n";
    return;
}
int main() {
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}