#include <bits/stdc++.h>
#define ll long long
#define QWQ cout<<"QwQ"<<endl;
#define FOR() ll le=e[u].size();for(ll i=0;i<le;i++)
using namespace std;
const ll N=501010;

inline ll read() {
	ll sum = 0, ff = 1; char c = getchar();
	while(c<'0' || c>'9') { if(c=='-') ff = -1; c = getchar(); }
	while(c>='0'&&c<='9') { sum = sum * 10 + c - '0'; c = getchar(); }
	return sum * ff;
}


int T;
int jishu;
int n,m;
int a[N];
int ru[N];
vector <int> e[N];
int ans[N],cnt;
priority_queue <int> q;
vector <int> g[N];

void chushihua() {
	for(ll i=1;i<=n;i++) ru[i] = 0, e[i].clear();
	for(ll i=1;i<=m;i++) g[i].clear();
	cnt = 0;
}

int main() {
	int x,y;
	T = read();
	while(T--) {
		jishu++;
		chushihua();
		n = read(); m = read();
		if (jishu==17)
		{
			cout<<m;
		}
		for(int i=1;i<=n;i++) {
			x = read();
			while(x--) {
				y = read();
				g[y].push_back(i);
				if (jishu==17)
				{
					cout<<i<<" "<<y<<"|";
				}
			}
		}
		for(int i=1;i<=m;i++) {
			if(g[i].size()==0) continue;
			int hou = g[i].back();
			for(auto v : g[i]) if(v != hou) e[v].push_back(hou), ru[hou]++;
		}
		for(int i=1;i<=n;i++) if(!ru[i]) q.push(i);
		while(!q.empty()) {
			int u = q.top(); q.pop();
			ans[++cnt] = u;
			FOR() {
				int v = e[u][i];
				ru[v]--;
				if(ru[v]==0) q.push(v);
			}
		}
		bool tong = 1;
		for(int i=1;i<=cnt;i++) if(i!=ans[i]) tong = 0;
		if(tong) {
			cout<<"No\n";
			continue;
		}
		cout<<"Yes\n";
		for(int i=1;i<=n;i++) cout<<ans[i]<<" \n"[i==n];
	}
	return 0;
}