#include<bits/stdc++.h>
using namespace std;
const int maxn = 100005;
int T, n, m;
vector<int> a[maxn];
bool p[maxn];
int x[maxn];
int s[maxn];
void work() {
    cin >> m >> n;
    for (int i = 1; i <= n; i++) s[i] = 0;
    for (int i = 1; i <= m; i++) {
        int k; cin >> k; a[i].clear();
        for (int j = 1; j <= k; j++) {
            int x; cin >> x;
            a[i].push_back(x);
        }
    }
    for (int i = 1; i < m; i++) {
        for (auto x : a[i]) p[x] = 1, s[x] = i;
        bool fl = 1;
        for (auto x : a[i + 1]) fl &= !p[x];
        for (auto x : a[i]) p[x] = 0;
        if (fl) {
            cout << "Yes" << '\n';
            for (int i = 1; i <= m; i++) x[i] = i;
            swap(x[i], x[i + 1]);
            for (int i = 1; i <= m; i++) cout << x[i] << " \n"[i == m];
            return;
        }
    }
    for (auto x : a[m]) s[x] = m;
    int minx = 1e9;
    for (int i = 1; i <= n; i++)
        if (s[i] != 0) minx = min(minx, s[i]);
    if (minx >= 3) {
        cout << "YES" << '\n';
        for (int i = 1; i <= m; i++) x[i] = i;
        swap(x[1], x[2]);
            for (int i = 1; i <= m; i++) cout << x[i] << " \n"[i == m];
            return;
    }
    cout << "No" << '\n';
}
int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    cin >> T;
    while (T--) work();
    return 0;
}