#include<bits/stdc++.h>
#define int long long
#define PII pair<int,int>
#define x first
#define y second
using namespace std;
const int N=5e3+5;
const int M=1e4+5;
void solve() {
	int n,m;
	cin>>n>>m;
	vector<int> G[n+1],in(n+1),vis[m+1];
	for(int i=1;i<=n;i++){
		int k;
		cin>>k;
		while(k--){
			int x;
			cin>>x;
			vis[x].push_back(i);
		}
	}
	for(int i=1;i<=m;i++){
		if(vis[i].size()==0) continue;
		if(vis[i][0]==vis[i][vis[i].size()-1]) continue;
		G[vis[i][0]].push_back(vis[i][vis[i].size()-1]);
		in[vis[i][vis[i].size()-1]]++;
	}
	vector<int> ans;
	priority_queue<int> q;
	for(int i=n;i>=1;i--){
		if(!in[i]){
			q.push(i);
		}
	}
	while(q.size()){
		int u=q.top();
		ans.push_back(u);
		q.pop();
		for(auto v:G[u]){
			in[v]--;
			if(in[v]==0){
				q.push(v);
			}
		}
	}
	bool yt=0;
	int t=1;
	for(auto x:ans){
		if(x!=t){
			yt=1;
			break;
		}
		t++;
	}
	if(!yt){
		cout<<"No\n";
	}else{
		cout<<"Yes\n";
		for(int i=0;i<ans.size();i++){
			if(i) cout<<" "<<ans[i];
			else cout<<ans[i];
		}
		cout<<"\n";
	}
}
signed main() {
	int T=1;
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	cin>>T;
	while(T--) {
		solve();
	}
}