#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;
            if (v[x])
            {
                g[v[x]].push_back(i);
                in[i]++;
            }
            v[x] = i;
        }
    }

    queue<int> q;
    for (int i = n; i >= 1; i--)
    {
        if (in[i] == 0)
            q.push(i);
    }

    vector<int> ans;
    while (!q.empty())
    {
        int now = q.front();
        q.pop();
        ans.push_back(now);
        for (auto it : g[now])
        {
            in[it]--;
            if (in[it] == 0)
                q.push(it);
        }
    }

    bool flag = 0;
    for (int i = 0; i < ans.size(); i++)
    {
        if (ans[i] != i + 1)
        {
            flag = 1;
            break;
        }
    }

    if (!flag)
        cout << "No" << endl;
    else
    {
        cout << "Yes" << endl;
        for (int i = 0; i < ans.size(); i++)
        {
            if (i)
                cout << ' ';
            cout << ans[i];
        }
        cout << endl;
    }
}

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

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

    return 0;
}