#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 9;
int vis[N];
vector<int>edge[N];
vector<int>root;

void dfs(int u,bool flag){
    if(flag){
        cout << u << ' ';
    }
    for(int v : edge[u]){
        if(!vis[v]){
            vis[v] = 1;
            dfs(v,flag);
        }
    }
}

void solve(){
    int n = 0,m = 0;
    cin >> n >> m;
    root.clear();
    for(int i = 1;i <= m;i++){
        vis[i] = 0;
    }
    for(int i = 1;i <= n;i++){
        edge[i].clear();
    }
    for(int i = 1;i <= n;i++){
        int num = 0;
        cin >> num;
        while(num--){
            int x = 0;
            cin >> x;
            if(vis[x]){
                edge[vis[x]].push_back(i);
            }
            vis[x] = i;
        }
    }
    for(int i = 1;i <= n;i++){
        vis[i] = 0;
    }
    for(int i = 1;i <= n;i++){
        if(!vis[i]){
            root.push_back(i);
            vis[i] = 1;
            dfs(i,false);
        }
    }
    if((int)root.size() == 1){
        cout << "No" << endl;
        return;
    }
    reverse(root.begin(),root.end());
    for(int i = 1;i <= n;i++){
        vis[i] = 0;
    }
    cout << "Yes" << endl;
    for(int x : root){
        if(!vis[x]){
            vis[x] = 1;
            dfs(x,true);
        }
    }
    cout << endl;
}

signed main(){
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    int t = 0;
    cin >> t;
    while(t--){
        solve();
    }
    return 0;
}