#include<bits/stdc++.h>
using namespace std;
int read(){
    int red=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){ if(ch=='-') f=-f;ch=getchar();}
    while(ch>='0'&&ch<='9') red=red*10+ch-48,ch=getchar();
    return red*f;
}
const int N=1e5+5;
int T,n,m,p[N];
vector<int>B[N];
int vis[N],Min[N],Up[N];
int ans[N];
void clear(){
    for(int i=1;i<=n;i++) Up[i]=0;
}
int main(){
    T=read();
    while(T--){
        clear();m=read(),n=read();
        for(int i=1;i<=m;i++){
            p[i]=read();
            B[i].resize(p[i]);;
            for(int j=0;j<p[i];j++) B[i][j]=read();
        }
        for(int i=m;i;i--){
            for(int j=0;j<p[i];j++){
                if(!vis[B[i][j]])
                    vis[B[i][j]]=i;
                else if(!Up[B[i][j]]) Up[B[i][j]]=i;
            }
        }
        bool ok=0;
        for(int i=2;i<=m;i++){
            int Up_=0;
            for(int j=0;j<p[i];j++) 
                if(vis[B[i][j]]==i)
                    Up_=max(Up_,Up[B[i][j]]);
            if(Up_+1<i){
                ok=1;
                for(int k=1;k<=Up_;k++) ans[k]=k;
                ans[Up_+1]=i;
                for(int k=Up_+2;k<=i;k++) ans[k]=k-1;
                for(int k=i+1;k<=m;k++) ans[k]=k;
                printf("Yes\n");
                for(int k=1;k<m;k++) printf("%d ",ans[k]);
                printf("%d\n",ans[m]);
                break;
            }
            int Lw_=m+1;
            for(int j=0;j<p[i];j++) 
                if(vis[B[i][j]]>i)
                    Lw_=min(Lw_,vis[B[i][j]]);
            if(Lw_-1>i){
                ok=1;
                for(int k=1;k<i;k++) ans[k]=k;
                for(int k=i;k<Lw_-1;k++) ans[k]=k+1;
                ans[Lw_-1]=i;
                for(int k=Lw_;k<=m;k++) ans[k]=k;
                printf("Yes\n");
                for(int k=1;k<m;k++) printf("%d ",ans[k]);
                printf("%d\n",ans[m]);
                break;
            }
        }
        if(!ok) printf("No\n");
    }
    return 0;
}