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

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, b, a) for(int i = (b) - 1; i >= (a); i--)
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int N = 1 << 17;
VI g[N];
int cnt[N];

void solve()
{
	int n, m;
	cin >> n >> m;
	vector<VI> a(n);
	VI lastInd(m, -1);
	FOR(i, 0, n)
	{
		int sz;
		cin >> sz;
		a[i].resize(sz);
		for(int& pos : a[i])
		{
			cin >> pos;
			pos--;
			lastInd[pos] = i;
		}
	}
	FOR(i, 0, n)
	{
		for(int pos : a[i])
		{
			if(lastInd[pos] == i)
				continue;
			g[i].PB(lastInd[pos]);
			cnt[lastInd[pos]]++;
		}
	}
	queue<int> q;
	FOR(i, 0, n)
		if(cnt[i] == 0)
			q.push(i);
	
	VI ans;
	while(SZ(q))
	{
		int v = q.front();
		ans.PB(v);
		q.pop();
		
		for(int to : g[v])
		{
			cnt[to]--;
			if(cnt[to] == 0)
				q.push(to);
		}
		g[v].clear();
	}
	FOR(i, 0, n)
	{
		assert(SZ(g[i]) == 0);
		assert(cnt[i] == 0);
	}
	bool ok = 0;
	FOR(i, 0, n)
		if(ans[i] != i)
			ok = 1;
	if(ok)
	{
		cout << "Yes\n";
		FOR(i, 0, n)
		{
			if(i > 0)
				cout << " ";
			cout << ans[i] + 1;
		}
		cout << "\n";
	}
	else
	{
		cout << "No\n";
	}
}


int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);
	cout << fixed << setprecision(15);
	
	int t;
	cin >> t;
	while(t--)
	{
		solve();
	}

	
	return 0;
}