#include <bits/stdc++.h>
using namespace std;

void solve() {
	int n, m;
	cin >> n >> m;
	vector<int> w[m + 1], d(n + 1);
	vector<int> g[n + 1];
	for (int i = 1; i <= n; i ++ ) {
		int p;
		cin >> p;
		while (p -- ) {
			int x;
			cin >> x;
			w[x].push_back(i);
		}
	}
	for (int i = 1; i <= m; i ++ ) {
		if (w[i].size() > 1) {
			for (int j = 0; j < w[i].size() - 1; j ++ ) {
				g[w[i][j]].push_back(w[i][w[i].size() - 1]);
				d[w[i][w[i].size() - 1]] ++ ;
			}
		}
	}
	priority_queue<int> q;
	vector<int> res;
	for (int i = 1; i <= n; i ++ )
		if (!d[i]) {
			q.push(i);
		}
	while (q.size()) {
		int x = q.top();
		q.pop();
		res.push_back(x);
		for (auto& t : g[x]) {
			if (-- d[t] == 0) q.push(t);
		}
	}
	vector<int> TT(n);
	for (int i = 0; i < res.size(); i ++ ) TT[i] = i + 1;
	if (res == TT) cout << "No\n";
	else {
		cout << "Yes\n";
		for (int i = 0; i < res.size(); i ++ ) 
			cout << res[i] << " \n"[i == res.size() - 1];
	}
}

int main() {
	int T;
	cin >> T;
	while (T -- ) {
		solve();
	}
	return 0;
}