#include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,a,n) for(int i=n;i>=a;i--)
#define pb emplace_back
#define pii pair<int ,int > 
#define ll long long 
#define endl '\n'
int dir[4][2]=
{
    {0,1},{0,-1},{1,0},{-1,0}  
};
const int N=1e5+10;
int a[N],indegree[N];
vector<int > v[N];
int topo[N];
int n,m;
bool cmp(int x,int y)
{
    return x>y;
}
void topoo()
{
    queue<int > q;
    int cnt=0;
    per(i,1,n)
    {
        if(indegree[i]==0)
        {
            q.push(i);
            topo[++cnt]=i;
            
        }
    }
    while(q.size())
    {
        int x=q.front();
        q.pop();
        sort(v[x].begin(),v[x].end(),cmp);
        for(auto i:v[x])
        {
            indegree[i]--;
            if(indegree[i]==0)
            {
                q.push(i);
                topo[++cnt]=i;
            }
        }
    }
    bool flag=0;
    rep(i,1,n)
    {
        if(topo[i]!=i)
        {
            flag=1;
            break;
        }
    }
    if(flag)
    {
        cout<<"Yes\n";
        rep(i,1,n)
        {
            cout<<topo[i];
            if(i<n)
            {
                cout<<" ";
            }
            else
            {
                cout<<endl;
            }
        }
        
    }
    else
    {
        cout<<"No\n";
    }
}
int main()
{
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int t;
    cin>>t;
    while(t--)
    {
        
        cin>>n>>m;
        fill(a+1,a+m+1,0);
        rep(i,1,n)
        {
            
            v[i].clear();
            indegree[i]=0;
            int num;
            cin>>num;
            while(num--)
            {
                int temp;
                cin>>temp;
                if(a[temp])//已经不是处了
                {
                    v[   a[temp]   ].pb(i);
                    indegree[i]++;
                }
                a[temp]=i;
            }
        }
        topoo();
    }
}