#include<bits/stdc++.h>
using namespace std;
const int maxn=2e5+10;
int Q,n,deg[maxn];
vector<int>e[maxn],buc[maxn];
inline void solve()
{
    cin>>Q>>n;
    for(int i=1,x;i<=Q;i++)
    {
        cin>>x;
        for(int j=1,z;j<=x;j++)
            cin>>z,buc[z].push_back(i);
    }
    for(int i=1;i<=n;i++) if(buc[i].size()>1)
    {
        int x=buc[i].back();buc[i].pop_back();
        for(auto y:buc[i]) e[x].push_back(y),deg[y]++;
    }
    
    priority_queue<int,vector<int>,greater<int> >q;
    for(int i=1;i<=Q;i++) if(!deg[i]) q.push(i);
    
    vector<int>ans;
    bool flag=false;
    while(!q.empty())
    {
        int x=q.top();q.pop();ans.push_back(x);
        if(q.size()>0) flag=true;
        for(auto y:e[x])
            if(--deg[y]==0) q.push(y);
    }
    if(flag)
    {
        cout<<"Yes\n";reverse(ans.begin(),ans.end());
        for(auto x:ans) cout<<x<<" ";cout<<'\n';
    }
    else cout<<"No\n";
}
signed main()
{
    ios::sync_with_stdio(false);cin.tie(NULL);
    int T;cin>>T;
    while(T--)
    {
        solve();
        for(int i=0;i<=max(n,Q);i++)
            deg[i]=0,e[i].clear(),buc[i].clear();
    }
}