#include<iostream>
#include<cstring>
#include<vector>
#include<string>
#include<queue>
#include<map>
#include<unordered_map>
#include<algorithm>
#include<bitset>
using namespace std;
//#define int long long
#define x first
#define y second
const int N = 1e5 + 10;
int n, m,p[N];
vector<int> v[N];

void solve()
{
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; i++) v[i].clear();

    int tmp, move;
    for (int i = 1; i <= n; i++)
    {
        scanf("%d", &tmp);
        while (tmp--)
        {
            scanf("%d", &move);
            v[i].push_back(move);
        }
    }
    vector<int> st(m + 1, -1);
    for (int i = n; i >= 2; i--)
    {
        vector<int> p1 = st, p2 = st;
        for (int j = 0; j < v[i].size(); j++)
        {
            st[v[i][j]] = i;
            p1[v[i][j]] = i;
        }
        for (int j = 0; j < v[i - 1].size(); j++)
        {
           // st[v[i-1][j]] = i-1;
            p1[v[i-1][j]] = i-1;
            p2[v[i-1][j]] = i-1;
        }
        for (int j = 0; j < v[i].size(); j++)
        {
            p2[v[i][j]] = i;
        }
        bool flag = true;
        for (int i = 1; i <= m; i++)
        {
            if (p1[i] != p2[i]) flag = false;
        }

        if (flag)
        {
            swap(p[i], p[i - 1]);
            printf("Yes\n");
            for (int i = 1; i <= n; i++)
            {
                printf("%d ", p[i]);
            }
            printf("\n");
            swap(p[i], p[i - 1]);
            return;
        }
    } 
    printf("No\n");
}

signed main()
{
    int T;
    scanf("%d", &T);
    for (int i = 1; i < N; i++) p[i] = i;
    while (T--)
    {
        solve();
    }

    return 0;
}