#include<bits/stdc++.h>

using namespace std;

using pii = pair<int, int>;
using vi = vector<int>;
using vpii = vector<pii>;
using vvi = vector<vi>;

void solve() {
    int n, m;
    cin >> n >> m;
    vector<set<int>> ops(n);
    for(int i = 0; i < n; i++) {
        int sz;
        cin >> sz;
        for(int j = 0; j < sz; j++) {
            int x;
            cin >> x;
            x--;
            ops[i].insert(x);
        }
    }
    vector<bool> shadow(m);
    for(int i = n-1; i >= 1; i--) {
        //swap i, i-1
        bool ok = true;
        for(int j : ops[i]) {
            if(!shadow[j] && ops[i-1].find(shadow[j]) != ops[i-1].end()) {
                ok = false;
            }
        }

        if(ok) {
            cout << "Yes" << endl;
            vi ans;
            for(int j = 0; j < i-1; j++) {
                ans.push_back(j);
            }
            ans.push_back(i);
            ans.push_back(i-1);
            for(int j = i+1; j < n; j++) {
                ans.push_back(j);
            }
            for(int j = 0; j < n; j++) {
                cout << ans[j]+1;
                if(j != n-1) {
                    cout << ' ';
                }
            }
            cout << endl;
            return;
        }

        for(int j : ops[i]) {
            shadow[j] = true;
        }
    }
    cout << "No" << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int tc;
    cin >> tc;
    while(tc--) {
        solve();
    }

    return 0;
}