#include<bits/stdc++.h>
#define int long long
#define all(x) (x).begin(), (x).end()
using pii = std::pair<int, int>;
void solve()
{
    int n, m;
    std::cin >> n >> m;
    std::vector<std::vector<int>> p(n + 1);
    for (int i = 1; i <= n; i ++)
    {
        int x;
        std::cin >> x;
        for (int j = 0; j < x; j ++)
        {
            int y;
            std::cin >> y;
            p[i].push_back(y);
        }
    }
    std::vector<std::vector<int>> adj(n + 1);
    std::vector<int> num(m + 1);
    std::vector<int> din(n + 1);
    for (int i = 1; i <= n; i ++)
    {
        for (int j = 0; j < p[i].size(); j ++)
        {
            if (!num[p[i][j]]) num[p[i][j]] = i;
            else
            {
                adj[num[p[i][j]]].push_back(i);
                din[i] ++;
                num[p[i][j]] = i;
            }
        }
    }
    std::vector<int> q(n);
    int hh = 0, tt = -1;
    for (int i = 1; i <= n; i ++)
        if (!din[i])
            q[++ tt] = i;
    std::vector<int> cnt(n);
    std::iota(all(cnt), 1);
    for (int i = 1; i <= n; i ++)
        std::sort(adj[i].rbegin(), adj[i].rend());
    while (hh <= tt)
    {
        int t = q[hh ++ ];
        for (auto j : adj[t])
        {
            if (-- din[j] == 0)
                q[++ tt] = j;
        }
    }
    bool ok = false;
    for (int i = 0; i < n; i ++)
        if (cnt[i] != q[i])
        {
            ok = true;
            break;
        }
    if (!ok) std::cout << "No\n";
    else
    {
        std::cout << "Yes\n";
        for (int i = 0; i < n; i ++)
            std::cout << q[i] << " \n"[i == n - 1];
    }
}
signed main()
{
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    std::ios::sync_with_stdio(false);
    int T = 1;
    std::cin >> T;
    while (T --) solve();
    return 0;
}