#include<bits/stdc++.h>
using namespace std;
inline int read() {
	int x = 0;
	char ch = getchar();
	while(ch < '0' || ch > '9') {
		ch = getchar();
	}
	while(ch >= '0' && ch <= '9') {
		x = (x << 1) + (x << 3) + (ch ^ 48);
		ch = getchar();
	}
	return x;
} 
int T, n, m;
int a[100010], in[100010], out[100010], ans[100010];
vector<int> f[100010], e[100010];
queue<int> q;
void solve() {
	for(int i = 1; i <= n; ++i) {
		if(f[i].size() <= 1) continue;
		int x = f[i][f[i].size() - 1], y;
		for(int j = 0; j < f[i].size() - 1; ++j) {
			y = f[i][j];
			e[y].push_back(x);
			in[x] += 1;
			out[y] += 1;
			//cout << y << "F" << x << endl;
		}
		
	}
	
	int cnt = 0, op = 0;
	
	for(int i = m; i >= 2; --i) {
		if(in[i] == 0 && out[i] == 0) {
			ans[++cnt] = i;
			continue;
		}
		if(in[i] == 0) q.push(i);
	}
	if(in[1] == 0 && out[1] == 0) op = 1;
	else if(in[1] == 0) q.push(1);
	while(!q.empty()) {
		int x = q.front();
		q.pop();
		ans[++cnt] = x;
		for(int i = 0; i < e[x].size(); ++i) {
			int y = e[x][i];
			in[y] -= 1;
			if(in[y] == 0) q.push(y);
		}
	}
	if(op == 1) ans[++cnt] = 1;
	//for(int i = 1; i <= cnt; ++i) cout << ans[i] << " ";
	//cout << endl;
	if(cnt < m) {
		printf("No\n");
		return;
	} 
	for(int i = 1; i <= m; ++i) {
		if(ans[i] != i) break;
		if(i == m) {
			printf("No\n");
			return;
		}
	}
	printf("Yes\n");
	for(int i = 1; i < m; ++i) printf("%d ", ans[i]);
	printf("%d", ans[cnt]);
}
int main() {
	T = read();
	while(T) {
		T -= 1;
		m = read();
		n = read();
		int num, x;
		for(int i = 1; i <= n; ++i) {
			a[i] = 0;
			in[i] = 0;
			out[i] = 0;
			ans[i] = 0;
			f[i].clear();
		} 
		for(int i = 1; i <= m; ++i) {
			num = read();
			for(int j = 1; j <= num; ++j) {
				x = read();
				f[x].push_back(i);
				a[x] = i;
			}
		}
		solve();
	}
	
	
	
}