// 哎 签到低手
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define PII pair<int,int>
#define PDI pair<double,int>
#define db double
#define all(x) (x).begin(),(x).end()
#define YES cout<<"Yes"<<endl;
#define NO cout<<"No"<<endl;
const int mod = 1e9+7;

void solve(){
    int n,m;cin>>n>>m;
    vector<int>v[n+1];
    for(int i=1;i<=n;i++){
        int x;cin>>x;
        while(x--){
            int now;cin>>now;
            v[i].push_back(now);
        }
    }
    for(int i=1;i<n;i++){
        unordered_map<int,int>t;
        int flag=0;
        for(auto j:v[i])t[j]++;
        for(auto j:v[i+1]){
            t[j]++;
            if(t[j]>=2){
                flag=1;
            }
        }
        if(!flag){
            cout<<"Yes"<<endl;
            vector<int>ans(n+1);
            for(int j=1;j<=n;j++)ans[j]=j;
            swap(ans[i],ans[i+1]);
            for(int j=0;j<ans.size();j++){
                if(j==0)cout<<ans[j];
                else cout<<' '<<ans[j];
            }cout<<endl;
            return;
        }
    }
    for(int i=1;i<n-1;i++){
        unordered_map<int,int>t;
        for(auto j:v[i])t[j]++;
        for(auto j:v[i+1])t[j]++;
        for(auto j:v[i+2]){
            if(t.count(j))t.erase(j);
        }
        if(!t.size()){
            cout<<"Yes"<<endl;
            vector<int>ans(n+1);
            for(int j=1;j<=n;j++)ans[j]=j;
            swap(ans[i],ans[i+1]);
            for(int j=0;j<ans.size();j++){
                if(j==0)cout<<ans[j];
                else cout<<' '<<ans[j];
            }cout<<endl;
            return;
        }
    }
    cout<<"No"<<endl;
}
signed main(){
    ios::sync_with_stdio(false);cin.tie(0);
    int t=1;cin>>t;
    while(t--)solve();
}