#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
using ll=long long;
using pii=pair<int,int>;
using vi=vector<int>;
using vl=vector<ll>;
#define pb push_back
#define all(a) begin(a),end(a)

const int MAXN=300010,MOD=1e9+7;
const char en='\n';
const ll LLINF=1ll<<60;

int t, n, m;
int a[MAXN], clash[MAXN], covered[MAXN];
vector <int> v[MAXN], r[MAXN], sol;
set <int> st;

int main () {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> t;
	while (t--) {
		cin >> n >> m;
		for (int i = 1; i <= m; i++) {
			a[i] = 0;
			covered[i] = 0;
			r[i].clear();
		}
		for (int i = 1; i <= n; i++) {
			v[i].clear();
			clash[i] = 0;
			
			int len;
			cin >> len;
			for (int j = 1; j <= len; j++) {
				int x;
				cin >> x;
				v[i].push_back(x);
				a[x] = j;
			}
		}
		
		st.clear();
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= (int)v[i].size(); j++) {
				int idx = v[i][j - 1];
				if (a[idx] != j) {
					clash[i]++;
					r[idx].push_back(i);
				}
			}
			if (clash[i] == 0) st.insert(i);
		}
		
		sol.clear();
		while (!st.empty()) {
			int i = *st.begin();
			st.erase(st.begin());
			sol.push_back(i);
			for (int j = 1; j <= (int)v[i].size(); j++) {
				int idx = v[i][j - 1];
				if (covered[idx] == 0) {
					for (auto k : r[idx]) {
						clash[k]--;
						if (clash[k] == 0) {
							st.insert(k);
						}
					}
				}
				covered[idx] = 1;
			}
		}
		reverse(sol.begin(), sol.end());
		
		bool ok = 0;
		for (int i = 1; i <= n; i++) {
			if (i != sol[i - 1]) ok = 1;
		}
		
		if (ok) {
			cout << "Yes\n";
			for (int i = 1; i <= n; i++) {
				cout << sol[i - 1];
				if (i < n) cout << " ";
			}
			cout << '\n';
		} else {
			cout << "No\n";
		}
	}
	return 0;
}