#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(v) v.begin(), v.end()
#define INF 0x3f3f3f3f
#define endl '\n'
const int mod = 998244353;
const int N = 1e5 + 10;
const int M = 1e5 + 10;

vector<int> g[N];
int in[N];

void solve()
{

    int n, m;
    cin >> n >> m;
    for (int i = 0; i <= m; i++)
    {
        g[i].clear();
    }
    vector<int> v(m + 10);
    for (int i = 1; i <= n; i++)
    {
        int a;
        cin >> a;
        for (int j = 0; j < a; j++)
        {
            int x;
            cin >> x;
            g[i].push_back(v[x]);
            in[v[x]]++;
            v[x] = i;
        }
    }

    bool flag = 1;
    for (int i = n; i > 0; i--)
    {
        if (g[i].back() != i - 1)
            flag = 0;
    }

    if (flag)
        cout << "No" << endl;
    else
    {
        cout << "Yes" << endl;
        vector<int> t;
        vector<bool> bl(n + 1);
        for (int i = n; i > 0; i--)
        {
            if (g[i].back() != i - 1)
            {
                t.push_back(i - 1);
                bl[i - 1] = 1;
            }
        }
        for (int i = 0; i < t.size(); i++)
        {
            if (i)
                cout << ' ';
            cout << t[i];
        }
        for (int i = 1; i <= n; i++)
        {
            if (!bl[i])
                cout << ' ' << i;
        }
        cout << endl;
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t;
    cin >> t;
    while (t--)
        solve();

    return 0;
}