#include <bits/stdc++.h>

using u32 = unsigned;
using i64 = long long;
using u64 = unsigned long long;

constexpr i64 inf = 1e18;

void solve() {
    int n, m;
    std::cin >> n >> m;

    std::vector adj(n, std::vector<int>()), nxt(n, std::vector<int>());
    std::vector<int> v(m, -1), in(n, 0);
    for (int i = 0; i < n; i++) {
        int p;
        std::cin >> p;
        adj[i].resize(p);
        for (int j = 0; j < p; j++) {
            std::cin >> adj[i][j];
            if (v[adj[i][j] - 1] != -1) {
                nxt[v[adj[i][j] - 1]].emplace_back(i);
                in[i]++;
            }
            v[adj[i][j] - 1] = i;
        }
    }

    std::vector<int> ans, vis(n, 0);
    auto dfs = [&](auto &&self, int x) -> void {
        if (!vis[x]) {
            vis[x] = 1;
            ans.emplace_back(x);
            for (int i = nxt[x].size() - 1; i >= 0; i--) {
                int y = nxt[x][i];
                // std::cout << x << " " << y << "\n";
                self(self, y);
            }
        }
    };

    for (int i = n - 1; i >= 0; i--) {
        if (!vis[i] && !in[i]) {
            dfs(dfs, i);
        }
    }

    std::vector<int> res(n);
    std::iota(res.begin(), res.end(), 0);
    if (res == ans) {
        std::cout << "No\n";
        return;
    }

    std::cout << "Yes\n";
    for (auto x : ans) {
        std::cout << x + 1 << " ";
    }
    std::cout << "\n";
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t;
    std::cin >> t;

    while (t--) {
        solve();
    }

    return 0;
}