#include <bits/stdc++.h>

using namespace std;
#define int long long
#define rep(i, l, r) for(int i = l; i <= (int)r; i ++)
#define debug(a) cout << #a << " = " << a << '\n';
#define debug2(a, b) cout << #a << " = " << a << "  " << #b << " = " << b << '\n';
const int N = 1e6 + 6;

int n, m, deg[N];
vector<int> pos[N];
vector<int> adj[N];
void solve() {
	cin >> n >> m;
	rep(i, 1, n) deg[i] = 0, adj[i].clear(); 
	rep(i, 1, m) pos[i].clear();
	rep(i, 1, n) {
		int p;
		cin >> p;
		rep(j, 1, p) {
			int index;
			cin >> index;
			pos[index].push_back(i);
		}
	}
	for(int i = 1; i <= n; i ++) {
		for(int j = 0; j + 1 < pos[i].size(); j ++) {
			adj[pos[i][j]].push_back(pos[i].back());
			// debug2(pos[i][j], pos[i].back());
			deg[pos[i].back()] ++;
		}
	}

	set<int> Q;
	rep(i, 1, n) if(deg[i] == 0) Q.insert(i);
	vector<int> ans;
	while(Q.size()) {
		auto x = *Q.rbegin();
		Q.erase(x);

		ans.push_back(x);
		// debug(x);
		for(auto y : adj[x]) {
			if(-- deg[y] == 0) {
				Q.insert(y);
			}
		}
	}


	if(ans.size() != n) {
		cout << "长度不够？\n";
		return ;
	}

	for(int i = 0; i < n; i ++) {
		if(ans[i] != i + 1) {
			cout << "Yes\n";
			for(int i = 0; i < ans.size(); i ++) {
				cout << ans[i] << " ";
			}
			cout << '\n';
			return ;
		}
	}
	cout << "No\n";
	
}
main() {
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    int _ = 1;
    cin >> _;
    while(_ --) {
    	solve();
    }
    return 0;
}