#include <iostream>
#include <algorithm>
#include <queue>
#include <cstring>
#include <vector>
using namespace std;
void solve()
{
	int n,m;cin>>n>>m;
	int in[n+10];
	int st[n+10];
	vector<int> v[n+10];
	for(int i=1;i<=n+10;i++) in[i]=0,st[i]=0;
	for(int i=1;i<=n;i++) {
		int x;cin>>x;
		for(int j=1;j<=x;j++) {
			int y;cin>>y;
			int t=st[y];
			st[y]=i;
			if(t!=0) {
				in[i]++;
				v[t].push_back(i);
			}
		}
	}
	queue<int> q;
	int cnt=0;
	for(int i=n;i>=1;i--) {
		if(in[i]==0) {
			q.push(i);cnt++;
		}
	}
	if(cnt<2) {
		cout<<"No"<<endl;
		return ;
	}
	
	queue<int> s;
	while(q.size()) {
		int t=q.front();
		s.push(t);q.pop();
		for(auto f:v[t]) {
			in[f]--;
			if(in[f]==0) {
				q.push(f);
			}
		}
	} 
	if(s.size()==n) {
		cout<<"Yes"<<endl;
		while(s.size()) {
			cout<<s.front()<<' ';
			s.pop();
		}
		cout<<endl;
	}
	else cout<<"No"<<endl;
	return ;
}
signed main(){
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--) solve();
    return 0;
}