#include <bits/stdc++.h>
#define fp(i, a, b) for (int i = a, i##_ = b; i <= i##_; ++i)
#define fd(i, a, b) for (int i = a, i##_ = b; i >= i##_; --i)

using namespace std;
using ll = long long;
const int N = 2e5 + 5;
int n, m, in[N];
vector<int> a[N], G[N];
void Solve() {
    scanf("%d%d", &m, &n);
    for (int p, i = 1; i <= m; ++i) {
        scanf("%d", &p);
        for (int x; p--;) scanf("%d", &x), a[x].push_back(i);
    }
    fp(i, 1, n) {
        if (a[i].size() < 2) continue;
        int v = a[i].back(); a[i].pop_back();
        for (auto u : a[i]) G[u].push_back(v), ++in[v];
    }
    queue<int> q;
    fp(i, 1, m) if (!in[i]) q.push(i);
    vector<int> ans, vis(n + 1);
    while (q.size() == 1) {
        int u = q.front(); q.pop();
        ans.push_back(u), vis[u] = 1;
        for (auto v : G[u])
            if (!--in[v]) q.push(v);
    }
    if (!q.empty()) {
        puts("Yes");
        int x = q.front(); q.pop();
        int y = q.front();
        if (x < y) swap(x, y);
        vis[x] = vis[y] = 1;
        ans.push_back(x), ans.push_back(y);
        fp(i, 1, m) if (!vis[i]) ans.push_back(i);
        fp(i, 0, m - 1) printf("%d%c", ans[i], " \n"[i == m - 1]);
    } else puts("No");
    fp(i, 1, m) G[i].clear(), in[i] = 0;
    fp(i, 1, n) a[i].clear();
}
int main() {
    int t = 1;
    scanf("%d", &t);
    while (t--) Solve();
    return 0;
}