#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;

#define int long long
typedef pair<int, int> pii;

const int mxn = 1e6 + 5;

int n, m, idx, cnt;
int to[mxn], nxt[mxn], head[mxn], indegree[mxn], ans[mxn];
vector<vector<int>> p;

void init()
{
    fill(head, head + m + 1, 0);
    fill(indegree, indegree + m + 1, 0);
    p.clear();
    p.resize(m + 1);
    idx = cnt = 0;
}

void add(int u, int v)
{
    to[++idx] = v;
    nxt[idx] = head[u];
    head[u] = idx;
}

void toposort()
{
    queue<int> q;
    for (int i = 1; i <= n; i++)
    {
        if (!indegree[i])
        {
            q.push(i);
        }
    }
    while (q.size())
    {
        int u = q.front();
        q.pop();
        ans[++cnt] = u;
        for (int i = head[u]; i; i = nxt[i])
        {
            int v = to[i];
            indegree[v]--;
            if (!indegree[v])
            {
                q.push(v);
            }
        }
    }
}

void solve()
{
    scanf("%lld%lld", &n, &m);
    init();

    for (int i = 1; i <= n; i++)
    {
        int k;
        scanf("%lld", &k);
        for (int j = 1; j <= k; j++)
        {
            int x;
            scanf("%lld", &x);
            p[x].push_back(i);
        }
    }

    for (int i = 1; i <= m; i++)
    {
        int sz = p[i].size();
        for (int j = 0; j < sz - 1; j++)
        {
            add(p[i][j], p[i][sz - 1]);
            indegree[p[i][sz - 1]]++;
        }
    }

    toposort();

    for (int i = 1; i <= n; i++)
    {
        if (ans[i] != i) // 检查跟原操作顺序是否相同
        {
            printf("Yes\n");
            for (int i = 1; i <= n; i++)
            {
                printf("%lld%c", ans[i],(i == n ? '\n' : ' '));
            }
            return;
        }
    }
    printf("No\n");
}

signed main()
{
    int T = 1;
    scanf("%lld", &T);
    while (T--)
    {
        solve();
    }

    return 0;
}