#include"bits/stdc++.h"

using namespace std;

const int N = 1e6 + 10;

int n, m;

vector<vector<int>> ve(N + 10);
vector<int> p(N + 10, 0), a(N + 10, 0), b(N + 10, 0), c(N + 10, 0);

void clear() {
for(int i = 1; i <= n; i++) a[i] = p[i] = b[i] = 0, ve[i].clear();
for(int i = 1; i <= m; i++) c[i] = 0;
}

void solve() {
cin >> n >> m;
for(int i = 1; i <= n; i++) {
cin >> p[i];
for(int j = 1; j <= p[i]; j++) {
int x;
cin >> x;
ve[i].push_back(x);
c[x] = j;
}
}

for(int i = 1; i <= n; i++) {
for(int j = 1; j <= p[i]; j++) {
if(c[ve[i][j - 1]] != j) a[ve[i][j - 1]] = i;
b[ve[i][j - 1]] = i;
}
}

int f = 0;
for(int i = 1; i <= n; i++) {
int res = 0;
for(int j = 1; j <= p[i]; j++) {
if(b[ve[i][j - 1]] == i) res = max(a[ve[i][j - 1]], res);
}
if(res + 1 < i) {
cout << "Yes" << "\n";
for(int j = 1; j <= n; j++) {
if(j == i) cout << i - 1 << " ";
else if(j == i - 1) cout << i << " ";
else cout << j << " ";
}
cout << "\n";
return ;
}
}
cout << "No" << "\n";
clear();
}
 

int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int t;
cin >> t;
while(t--) solve();
return 0;
}

/*

3
3 6
3 3 1 5
2 5 3
2 2 6
2 3
3 1 3 2
2 3 1
1 3
2 2 1

*/