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

const int N = 1e5+7;
int val[N];


void solve()
{
	int n, m;
	cin >> n >> m;
	
	vector<vector<int>> b(n+1);
	for (int i = 1; i <= n; ++i)
	{
		int p;
		cin >> p;
		while (p--)
		{
			int x;
			cin >> x;
			b[i].push_back(x);
		}
	}
	
	for (int i = 1; i < n; ++i)
	{
		set<int> s;
		for (auto v : b[i]) s.insert(v);
		for (auto v : b[i+1]) s.insert(v);
		
		if (s.size() == b[i].size() + b[i+1].size())
		{
			cout << "Yes\n";
			for (int j = 1; j <= n; ++j)
			{
				if (j == i) cout << i+1 << " ";
				else if (j == i + 1) cout << i << " ";
				else cout << j << " ";
			}
			cout << "\n";
			return;
		}
	}
	
	
	cout << "No\n";
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int t;
	cin >> t;
	while (t--) solve();
	return 0;
 }