#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr ll N=1e5;
vector<ll>a[N];
ll pre[N+1];
ll last[N+1];
ll ans[N];
ll n;
inline ll solve()
{
    ll i,xmax;
    for(i=1;i<n;i++)
    {
        xmax=0;
        for(auto&&j:a[i])
        {
            if(last[j]==i)xmax=max(xmax,pre[j]);
            pre[j]=i+1;
        }
        if(xmax<i)return i;
    }
    return 0;
}
int main()
{
    ll t,m,k,i,j,di;
    ios::sync_with_stdio(0),cin.tie(0);
    cin>>t;
    while(t--)
    {
        cin>>n>>m;
        for(i=0;i<n;i++)
        {
            cin>>k,a[i].resize(k);
            for(j=0;j<k;j++)cin>>a[i][j],last[a[i][j]]=i;
        }
        di=solve();
        if(di)
        {
            cout<<"Yes\n";
            iota(ans,ans+n,1);
            swap(ans[di-1],ans[di]);
            for(i=0;i<n;i++)cout<<ans[i]<<" \n"[i==n-1];
        }
        else cout<<"No\n";
        for(i=0;i<n;i++)a[i].clear();
        memset(pre+1,0,m*sizeof(ll));
        memset(last+1,0,m*sizeof(ll));
    }
    return 0;
}