#include<bits/stdc++.h>

using namespace std;
void solve()
{
    int n,m;
    cin>>n>>m;
    vector<vector<int> > b(n+1);
    vector<int > c(n+1);
    for(int i=1;i<=n;i++)
    {
        int k;
        cin>>k;
        for(int j =1;j<=k;j++)
        {
            int x;
            cin>>x;
            b[i].push_back(j);
            c[j] = i;
        }
    }
    int pos=  -1;
    for(int i=1;i<n;i+=2)
    {
        vector<int> vis(n+1);
        for(int j :b[i])
        {
            vis[j] = 1;
        }
        int flag = 0;
        for(int j:b[i+1])
        {
            if(vis[j]&&c[j]==i+1)
            {
                flag = 1;
                break;
            }
        }
        if(!flag)
        {
            pos = i;
        }
    }
    if(pos==-1)
    {
        cout<<"No\n";
        return ;
    }
    cout<<"Yes\n";
    for(int i=1;i<=n;i++)
    {
        if(i==pos)
        {
            cout<<i+1<<' '<<i;
            i++;
            if(i!=n)cout<<" ";
        }
        else
        {
            cout<<i;
            if(i!=n)cout<<" ";
        }
    }
    cout<<endl;

    

}
int main()
{
    int T;
    cin>>T;
    while(T--)
    {
        solve();
    }
    return 0;
}