#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for(int i=j;i<=k;++i)
#define per(i,j,k) for(int i=j;i>=k;--i)
int const N=1e5+10;
bool vis[N];vector<int>a[N];
inline void solve(){
	int n,m;cin>>n>>m;
	rep(i,1,n) a[i].clear();
	rep(i,1,n){
		int x;cin>>x;
		while (x--){
			int y;cin>>y;
			a[i].push_back(y);
		}
	}
	rep(i,1,n-1){
		for (auto x:a[i]) vis[x]=1;
		bool win=1;
		for (auto x:a[i+1]) win&=!vis[x];
		for (auto x:a[i]) vis[x]=0;
		if (win){
			vector<int>a(n+1);
			rep(i,1,n) a[i]=i;
			swap(a[i],a[i+1]);
			cout<<"Yes\n";
			rep(i,1,n) cout<<a[i]<<' ';
			cout<<'\n';
			return;
		}
	}
	cout<<"No\n";
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	int t;cin>>t;
	while (t--) solve();
	return 0;
}