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

void solve() {
	int n, m;
	cin >> n >> m;

	vector<vector<int>> a(n);
	for (int i = 0; i < n; i++) {
		int p;
		cin >> p;
		a[i].resize(p);
		for (int j = 0; j < p; j++)
			cin >> a[i][j], a[i][j]--;
	}

	vector<int> col(n);

	for (int i = n - 1; i >= 0; i--) {
		bool ok = true;
		for (int j = 0; j < a[i].size(); j++)
			if (!col[a[i][j]]) {
				col[a[i][j]] = i + 1;
			} else if (col[a[i][j]] == i + 2) {
				ok = false;
			}
		if (ok && i != n - 1) {
			cout << "Yes\n";
			for (int j = 0; j < i; j++)
				cout << j + 1 << " ";
			cout << i + 2 << " " << i + 1;
			if (i <= n - 2) {
				cout << " ";
				for (int j = i + 2; j < n; j++) {
					cout << j + 1;
					if (j < n - 1)
						cout << " ";
				}
			}
			cout << '\n';
			return;
		}
	}

	cout << "No\n";
}

int main() {
	int t;
	cin >> t;

	while (t--)
		solve();
}