#include<bits/stdc++.h>

#define int long long 
#define endl '\n'
using namespace std ;

const int N = 1e5 + 10;

vector<int> d[N], g[N];
map<int,int> mp[N];
int cnt[N], a[N];

void solve() {

	int n, m;
	cin>>n>>m;

	for(int i=1;i<=n;i++) mp[i].clear(), g[i].clear(), cnt[i] = 0;
	for(int i=1;i<=m;i++) a[i] = 0, d[i].clear();
	for(int i=1;i<=n;i++) {
		int x;
		cin>>x;
		for(int j=1;j<=x;j++) {
			int y;
			cin>>y;
			a[y] = i;
			d[y].push_back(i);
		}
	}

	for(int i=1;i<=m;i++) {
		int v = a[i];
		for(int u : d[i]) {
			if(mp[u][v]||mp[v][u]||u==v) continue;
			mp[u][v] = mp[v][u] = 1;
			g[u].push_back(v);
			cnt[v]++;
		}
	}

	queue<int> q;
	for(int i=n;i>=1;i--) {
		if(!cnt[i]) {
			q.push(i);
		}
	}

	int cur = 0;
	int ok = 0;
	vector<int> ans;	
	while(!q.empty()) {
		int u = q.front();
		ans.push_back(u);
		cur++;
		q.pop();
		vector<int> e;
		for(int v : g[u]) {
			cnt[v]--;
			if(!cnt[v]) e.push_back(v);
		}
		int ff = 0;
		for(int x : e) {
			if(cur+1!=x) {
				ff = x;
				break;
			}
		}
		if(ff) {
			ok = 1;
			cur++;
			q.push(ff);
			for(int x : e) {
				if(ff==x) continue;
				q.push(x);
				cur++;
			}
		}
		else {
			for(int x : e) {
				cur++;
				q.push(x);
			}
		}
	}

	int len = ans.size(), f = 0;
	for(int i=0;i<len;i++) {
		if(ans[i]!=i+1) {
			f = 1;
		}
	}
	if(!f&&!ok) {
		cout<<"No"<<endl;
		return ;
	}

	cout<<"Yes"<<endl;
	for(int i=0;i<len-1;i++) cout<<ans[i]<<" ";
	cout<<ans.back()<<endl;

}

signed main() {

	ios::sync_with_stdio(0) ;
	cout.tie(0) ;
	cin.tie(0) ;
	int t = 1;
	cin >> t;
	while(t --){
		solve() ;
	}
	return 0 ;
}