#pragma GCC optimize(3, "Ofast", "inline")
#include <iostream>
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define INF 0x3f3f3f3f
#define L_INF 0x7f3f3f3f3f3f3f3f
#define db cout << "debug\n";

using namespace std;
const int Mod = 998244353;
using ll = long long;
int a[2][100010];
int p[100010];
void solve()
{
    int n, m;
    cin >> n >> m;
    for (int i = 0; i <= m; i++)
        a[0][i] = 0, a[1][i] = 0,p[i]=0;
    
    int cnt[2];
    cin >> cnt[1];
    for (int i = 1; i <= cnt[1]; i++)
    {
        int x;
        cin >> x;
        a[1][i] = x;
        p[x]++;
    }
    int ans = 0;
    for (int i = 2; i <= n; i++)
    {
        int flag = 0;
        int e = i % 2;
        cin >> cnt[e];
        for (int i = 1; i <= cnt[e]; i++)
        {
            int x;
            cin >> x;
            a[e][i] = x;
            p[x]++;
            if (p[x] > 1)
                flag = 1;
        }
        if (flag == 0)
        {
            ans = i;
            break;
        }
        for (int i = 1; i <= cnt[1 - e]; i++)
        {
            p[a[1 - e][i]]--;
        }
    }
    if (ans)
    {
        cout << "Yes\n";
        for (int i = 1; i < ans - 1; i++)
            cout << i << " ";
        cout << ans << " " << ans - 1 << " ";
        for (int i = ans + 1; i <= n; i++)
            cout << i << " ";
        cout << "\n";
    }
    else
    {
        cout << "No\n";
    }
}
int main()
{
    IOS;
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#ifndef ONLINE_JUDGE
    clock_t start_time = clock();
#endif
    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
#ifndef ONLINE_JUDGE
    cout << "Used " << (double)(clock() - start_time) << " ms" << endl;
#endif
    return 0;
}