#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define inf 0x3f3f3f3f
#define db double
#define il inline
#define x first
#define y second
#define endl '\n'
const int N = 2e5 + 5;
const int mod = 998244353;
vector<int>g[N];
int s[N], in[N];
int cmp(int a, int b)
{
    return a > b;
}
void solve()
{
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        g[i].clear();
        in[i] = 0;
    }
    for (int i = 1; i <= m; i++) s[i] = 0;
    for (int i = 1; i <= n; i++)
    {
        int p; cin >> p;
        for (int j = 1; j <= p; j++)
        {
            int b; cin >> b;
            if (s[b]) g[s[b]].push_back(i);
            s[b] = i;
        }
    }
    for (int i = 1; i <= n; i++)
    {
        sort(g[i].begin(), g[i].end());
        g[i].erase(unique(g[i].begin(), g[i].end()), g[i].end());
        
        for (auto j: g[i]) in[j]++;
        sort(g[i].begin(), g[i].end(), cmp);
    }
    queue<int> q;
    vector<int> ret;
    for (int i = 1; i <= n; i++)
    {
        if (in[i] == 0) 
        {
            q.push(i);
            ret.push_back(i);
        }
    }
    int f = 0;
    while(q.size())
    {
        if (q.size() != 1) f = 1;
        int t = q.front();
        q.pop();
        for (auto i: g[t])
        {
            in[i]--;
            if(in[i] == 0) 
            {
                q.push(i);
                ret.push_back(i);
            }
        }
    }
    if (f)
    {
        cout << "Yes\n";
        for (auto i: ret) cout << i << ' ';
        cout << '\n';
    }
    else cout << "No\n";
}
signed main()
{
    // freopen("D:\\3022244240\\vscode\\txt\\in.txt", "r", stdin);
    // freopen("D:\\3022244240\\vscode\\txt\\out.txt", "w", stdout);
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    int T = 1; cin >> T;
    while (T--) solve();
    return 0;
}