#include <bits/stdc++.h>
using namespace std;
int book[100005],last[100005],ans[100005],head[100005],cnt,d[2000006],sum,g[100005];
struct node{
    int y,next;
}e[500005];
void add(int x,int y){
    e[++cnt].y=y;
    e[cnt].next=head[x];
    head[x]=cnt;
}
void dfs(int x){
    sum++;
    for(int i=head[x];i;i=e[i].next)
        if(!book[e[i].y]){
            book[e[i].y]=1;
            dfs(e[i].y);
        }
}
int main()
{
    
    int t;
    cin>>t;
    while(t--){
        int n,m,p=0;cnt=0;
        cin>>m>>n;
        vector<vector<int > > d(m+1);
        for(int i=1;i<=n;i++)last[i]=0;
        for(int i=1;i<=m;i++)ans[i]=i,head[i]=book[i]=0;
        for(int i=1;i<=m;i++){
            int k;
            cin>>k;
            d[i].resize(k+1);
            d[i][0] = k;
            for(int j=1;j<=k;j++){
                cin>>d[i][j];
                last[d[i][j]]=i;
            }
            sort(d[i].begin()+1,d[i].end());
        }
        cnt=0;
        for(int i=1;i<=m;i++){
            int k=d[i][0];;
            for(int j=1;j<=k;j++)
                if(last[d[i][j]]!=i)
                    add(i,last[d[i][j]]);
        }
        book[1]=1;
        sum=0;
        dfs(1);
        if(sum!=m){
            for(int i=2;i<=n;i++)
                if(book[i]!=book[i-1]){
                    int q=0;
                    for(int l=1,r=1;l<=d[i-1][0]&&r<=d[i][0];)
                        if(d[i-1][l]>d[i][r])r++;
                        else if(d[i-1][l]<d[i][r])l++;
                        else {
                            if(last[d[i][r]]==i){q=1;break;}
                            l++,r++;
                        }
                    if(!q){
                        swap(ans[i],ans[i-1]);
                        break;
                    }
            }
            cout<<"Yes"<<endl;
            for(int i=1;i<=m;i++)
                cout<<ans[i]<<" ";
            cout<<endl;
        }
        else cout<<"No"<<endl;
    }
    return 0;
}