#include<bits/stdc++.h>
using namespace std;
using LL = long long;

void solve() {
    int m, n; cin >> m >> n;
    vector<int> cnt(n + 1);
    vector<vector<int>> op(m + 1);
    for(int i = 1; i <= m; i++) {
        int k; cin >> k;
        op[i].resize(k + 1);
        for(int j = 1; j <= k; j++) {
            cin >> op[i][j];
        }
    }
    for(int i = m; i >= 1; i--) {
        int mx = 0;
        for(int j = 1; j < op[i].size(); j++) {
            int x = op[i][j];
            cnt[x]++;
            mx = max(cnt[x], mx);
            // cerr << "i = " << i << " mx = " << mx << '\n';
        }
        if(mx == 1 && i < m) {
            cout << "Yes\n";
            for(int j = 1; j <= m; j++) {
                if(j == i) cout << j + 1 << " ";
                else if(j == i + 1) cout << i << " ";
                else cout << j << " ";
            }
            cout << '\n';
            return;
        }
        if(i < m) {
            for(int j = 1; j < op[i + 1].size(); j++) {
                int x = op[i + 1][j];
                cnt[x]--;
            }
        }
    }
    cout << "No\n";
}

int main() {
    cin.tie(0)->sync_with_stdio(false);
    int t; cin >> t;
    while(t--) solve();
    return 0;
}