#include <bits/stdc++.h>
using i64 = long long;
using namespace std;
const int N = 1e5 + 5;
// const int B = 400;
// const int M = 2e5 + 5;
// const int base = 13331;
// const int mod = 998244353;
// const int mod = 1e9 + 7;
// const double pi = acos(-1);

int n, m, deg[N], ans[N], tot;
vector<int> num[N], adj[N];
void solve()
{
    cin >> n >> m;
    for (int i = 1, k, x; i <= n; i++)
    {
        cin >> k;
        while (k--)
        {
            cin >> x;
            num[x].push_back(i);
        }
    }
    for (int i = 1; i <= m; i++)
    {
        if (num[i].size() <= 1)
            continue;
        for (int j = 0; j < num[i].size() - 1; j++)
            adj[num[i][j]].push_back(num[i].back()), deg[num[i].back()]++;
    }
    priority_queue<int> que;
    for (int i = 1; i <= n; i++)
        if (!deg[i])
            que.push(i);
    while (!que.empty())
    {
        int cur = que.top();
        que.pop();
        ans[cur] = ++tot;
        for (int i : adj[cur])
            if (!--deg[i])
                que.push(i);
    }
    bool flag = false;
    for (int i = 1; i <= n; i++)
        if (ans[i] ^ i)
            flag = true;
    if (!flag)
        cout << "No\n";
    else
    {
        cout << "Yes\n";
        for (int i = 1; i <= n; i++)
            cout << ans[i] << ' ';
        cout << '\n';
    }
    for (int i = 1; i <= n; i++)
        adj[i].clear(), ans[i] = 0;
    for (int i = 1; i <= m; i++)
        num[i].clear();
    tot = 0;
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    cin >> t;
    // cout << fixed << setprecision(10);
    while (t--)
        solve();
}