#include <bits/stdc++.h>
using namespace std;
void solve()
{  
    int n,m;cin>>n>>m;
    vector<int> a(m+1);
    vector<vector<int>> p(n+1);
    vector<vector<int>> ve(n+m+5);
    vector<int> cnt(n+m+5,0);
    auto add = [&](int x,int y){
        cnt[y]++;
        ve[x].push_back(y);
    };
    for(int i=1;i<=n;i++){
        int siz;cin>>siz;
        p[i].resize(siz);
        for(int j=0;j<siz;j++)cin>>p[i][j],a[p[i][j]]=i;
    }
    for(int i=1;i<=n;i++){
        for(auto it:p[i]){
            if(a[it]==i)add(i,it+n);
            else add(it+n,i);
        }
    }
    vector<int> tp;
    priority_queue<int,vector<int>,greater<int>> qu;
    for(int i=1;i<=n+m;i++)if(cnt[i]==0)qu.push(i);
    while(!qu.empty()){
        int x=qu.top();qu.pop();
        tp.push_back(x);
        for(auto it:ve[x]){
            if(--cnt[it]==0){
                qu.push(it);
            }
        }
    }
    for(int i=1;i<=n;i++)if(cnt[i]>0){
        cout<<"No\n";return;
    }
    vector<int> ans;
    for(auto it:tp)if(it<=n)ans.push_back(it);
    reverse(ans.begin(),ans.end());
    bool bb=true;
    for(int i=0;i<n;i++)if(i+1!=ans[i])bb=false;
    if(bb){
        cout<<"No\n";return;
    }
    cout<<"Yes\n";
    for(auto it:ans)cout<<it<<" \n"[it==ans.back()];
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T;cin>>T;while(T--)solve();
    return 0;
}