#include<cstdio>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<string.h>
#include<iomanip>
#include<stack>
#include<deque>
#include<queue>
#include<vector>
#include<map>
#include<set>
#define ll               long long
#define endl             "\n"
using namespace std;
inline int read() { register int s = 0, w = 1; char ch = getchar(); while (ch < '0' || ch > '9') { if (ch == '-')w = -1; ch = getchar(); }while (ch >= '0' && ch <= '9')s = s * 10 + ch - '0', ch = getchar(); return s * w; }
ll t, q, n, a[200005], b[200005], p, num[200005], c[200005], d[200005], up[200005];
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    cin >> t;
    while (t--)
    {
        cin >> q >> n;
        for (int i = 1; i <= q; i++)
        {
            cin >> num[i];
            for (int j = 1; j <= num[i]; j++)
            {
                cin >> p;
                b[p] = a[p];
                a[p] = i;
            }
        }
        for (int i = 1; i <= n; i++)
        {
            c[a[i]]++;
            d[a[i]] = max(b[i], d[a[i]]);
        }
        bool flag=0;
        for(int i=2;i<=q;i++)
        {
            if(d[i]!=i-1)
            {
                flag=1;
                cout<<"Yes"<<endl;
                for(int j=1;j<=q;j++)
                {
                    if(j==i-1)
                        cout<<j+1;
                    else if(j==i)
                        cout<<j-1;
                    else cout<<j;
                    if(j!=n)cout<<" ";
                }
            }
        }
        if (!flag)cout << "No";
        if (t)cout << endl;
        for (int i = 1; i <= max(n,q); i++)
        {
            a[i] = b[i] = c[i] = d[i] = num[i] = 0;
        }
    }
    return 0;
}