#include <bits/stdc++.h>
#define int long long
#define AC return 0;
#define pii pair<int, int>
#define all(tar) tar.begin(), tar.end()
using namespace std;
#define endl "\n"
const int mod = 1e9 + 7;
const int maxx = 1e6 + 5;
int n, m, t;
pii p[maxx];
void solve() {
	int n, m;
	cin >> n >> m;
	map<int, int>mp, pre;
	int flagg = 0;
	for (int i = 1; i <= n; i++) {
		int mm;
		cin >> mm;
		int flag = 1;
		for (int j = 1; j <= mm; j++) {
			int cache;
			cin >> cache;
			if (pre.count(cache)) flag = 0;
			mp[cache] = 1;
		}
		pre = mp;
		if (i != 1 && flag && flagg == 0) {
			flagg = i;
		}
	}
	if (n == 1 || flagg == 0) {
		cout << "No" << endl;
		return;
	}
	cout << "Yes" << endl;
	for (int i = 1; i <= n; i++) {
		if (i == flagg) {
			cout << i - 1 << " ";
			continue;
		}
		if (i + 1 == flagg) {
			cout << i + 1 << " ";
			continue;
		}
		cout << i << " ";
	}
	cout << endl;
}
signed main() {
	cin.tie(0);
	cout.tie(0);
	ios::sync_with_stdio(false);
	cin >> t;
	while (t--) {
		solve();
	}
	AC
}