#include <bits/stdc++.h>

using i64 = long long;

int n, m, deg[100010];
std::vector<int> pos[100010], G[100010];

void solve() {
    std::cin >> n >> m;
    for (int i = 0; i <= n; ++i) {
        pos[i].clear();
        G[i].clear();
        deg[i] = 0;
    }
    for (int i = 1; i <= n; ++i) {
        int p; std::cin >> p;
        for (int j = 1; j <= p; ++j) {
            int x; std::cin >> x;
            pos[x].push_back(i);
        }
    }

    for (int i = 1; i <= n; ++i) {
        if (pos[i].size() <= 1) {
            continue;
        }
        int x = pos[i].back();
        for (auto v : pos[i]) {
            if (v != x) {
                G[v].push_back(x);
                ++deg[x];
            }
        }
    }

    std::queue<int> Q;
    std::vector<int> ans;
    for (int i = 1; i <= n; ++i) {
        if (deg[i] == 0) {
            Q.push(i);
        }
    }
    while (!Q.empty()) {
        int u = Q.front(); Q.pop();
        ans.push_back(u);
        for (auto v : G[u]) {
            if (--deg[v] == 0) {
                Q.push(v);
            }
        }
    }
    bool ok = 0;
    for (int i = 0; i < n; ++i) {
        if (ans[i] != i + 1) {
            ok = 1;
            break;
        }
    }
    if (ok) {
        std::cout << "Yes\n";
        for (auto v : ans) {
            std::cout << v << " ";
        }
        std::cout << "\n";
    } else {
        std::cout << "No\n";
    }
}

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

    int T; std::cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}