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

void solve() {
    int n, m;
    cin >> n >> m;
    vector<vector<int> > g(n), a(m);
    vector<int> deg(n);
    for(int i = 0, p; i < n; i ++) {
        cin >> p;
        for(int j = 0, x; j < p; j ++) {
            cin >> x;
            a[x - 1].push_back(i);
        }
    }
    
    for(int i = 0; i < m; i ++) {
        if(a[i].size() > 1) {
            for(int j = 0; j + 1 < a[i].size(); j ++)
                g[a[i][j]].push_back(a[i].back());
                deg[a[i].back()] ++;
        }
    }

    priority_queue<int> q;
    for(int i = 0; i < n; i ++)
        if(deg[i] == 0)
            q.push(i);
    
    vector<int> ans;
    while(q.size()) {
        int u = q.top();
        q.pop();
        ans.push_back(u);
        for(auto v : g[u]) {
            if(--deg[v] == 0)
                q.push(v);
        }
    }
    for(int i = 0; i < n; i ++)
        if(ans[i] != i) {
            cout << "Yes\n";
            for(auto x : ans)
                cout << x + 1 << " \n"[x == ans.back()];
            return;
        }
    cout << "No\n";
}

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

    int T;
    cin >> T;
    while(T --)
        solve();
}