#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#define int long long
#define pb push_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define ff first
#define ss second
#define bb begin()
#define ee end()
#define pii pair<int,int>
using namespace std;
void solve()
{
	int n,m;cin>>n>>m;
	vvi b(n+1);
	bool suc=false;
	int cur=0;
	vi p(n+1);
	for(int i=1;i<=n;i++)
	{
		cin>>p[i];
		b[i].resize(p[i]+1);
		for(int j=1;j<=p[i];j++) cin>>b[i][j];
	}
	for(int i=1;i<=n;i++)
	{
		bool f=false;
		if(i==1) continue;
		map<int,int> mp1,mp2;
		for(int j=1;j<=max(p[i-1],p[i]);j++)
		{
			if(j<=p[i-1]) mp1[b[i-1][j]]++;
			if(j<=p[i]) mp2[b[i][j]]++;
		}
		for(auto [u,v]:mp2)
		{
			if(mp1[u]) 
			{
				f=true;
			}
		}
		if(!f)
		{
			suc=true;
			cur=i;
			break;
		}
	}
	if(!suc){
		cout<<"No"<<endl;
		return ;
	}
	cout<<"Yes"<<endl;
	for(int i=1;i<cur-1;i++) cout<<i<<' ';
	cout<<cur<<' '<<cur-1;
	for(int i=cur+1;i<=n;i++) cout<<i<<' '; 
	cout<<endl;
}
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int T;cin>>T;
	while(T--)
	{
		solve();
	}
	return 0;
}