#include <bits/stdc++.h>
#include <iostream>

using namespace std;
 
typedef long long ll;

typedef long double ld;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef pair<ll,ll> PLL;
#define i128 _int128

#define fi first
#define se second 
#define pb push_back

#define ICPC_CD return
#define Chong 0
#define endl '\n'

const ll INF=0x3f3f3f3f;
const ll N=2e6+9;
const ll mod=998244353;

int n,m;
map<int,int> v[N];
int check[N];
map<int,int> v1;
int all;

void solve(){
    cin>>n>>m;memset(check,0,sizeof(check));v1.clear();all=0;
    if(n==1)cout<<"No"<<endl;
    else{
        for(int i=1;i<=n;++i){
            int x;cin>>x;v[i].clear();
            if(x==m && i>=3 && i<n)all=1;
            for(int j=1;j<=x;++j){
                int xx;cin>>xx;
                v[i][xx]=i;
            }
        }
        if(all==1){
            cout<<"Yes"<<endl<<2<<' '<<1;
            for(int i=3;i<=n;++i){
                cout<<' '<<i;
            }
            cout<<endl;
        }
        else{
            for(int i=1;i<=n;++i){
                for(int j=1;j<=m;++j){
                    if(v[i][j]){
                        if(v1[j]){
                            check[v1[j]]=1,check[i]=1;
                        }
                        v1[j]=v[i][j];
                    }
                }
            }
            int f=0,id=0;
            for(int i=1;i<=n;++i){
                if(check[i]==0){f=1,id=i;break;}
            }
            if(f){
                cout<<"Yes"<<endl<<id;
                for(int i=1;i<=n;++i){
                    if(i==id)continue;
                    cout<<' '<<i;
                }
                cout<<endl;
            }
            else{
                cout<<"No"<<endl;
            }
        }
    }
    
    
    
}



signed main(){
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    
    int _=1;
    cin>>_;
    
    while(_--)solve();

    ICPC_CD Chong;
}