#include <bits/stdc++.h>

bool chk(std::vector<int>& a) {
    int n = a.size();
    for (int i = 0; i < n; ++i)
        if (a[i] != i + 1)
            return 0;
    return 1;
}

int main() {
    //freopen("in", "r", stdin);
    int ttt;
    std::cin >> ttt;
    while (ttt--) {
        int n, m;
        std::cin >> n >> m;
        std::vector<int> b(m + 1), ind(n + 1);
        std::vector ver(n + 1, std::vector<int>(0));
        for (int i = 1; i <= n; ++i) {
            int p, x;
            std::cin >> p;
            while (p--) {
                std::cin >> x;
                if (b[x]) {
                    ver[b[x]].push_back(i);
                    ++ind[i];
                }
                b[x] = i;
            }
        }
        std::queue<int> q;
        std::vector<int> ans;
        for (int i = n; i >= 1; --i) {
            if (!ind[i]) {
                q.push(i);
            }
        }
        while (!q.empty()) {
            int u = q.front(); q.pop();
            ans.emplace_back(u);
            for (auto &v: ver[u]) {
                --ind[v];
                if (!ind[v])
                    q.push(v);
            }
        }
        if (chk(ans)) {
            std::cout << "No\n";
            continue;
        }
        std::cout << "Yes\n";
        for (int i = 0; i < n; ++i)
            std::cout << ans[i] << " \n"[i == n - 1];
    }
    return 0;
}