//ALL IN
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define int long long
#define double long double
const int N=2e5+7;
const int mod=1e9+7;
const int inf=4e18;
mt19937 rnd(time(0));
clock_t start,over;// start=clock(); last=(final-over)*1.0/1000
inline int read(){int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=x*10+ch-'0',ch=getchar();}return x*f;}
inline void write(int x){if(x<0)putchar('-'),x=-x;if(x>9)write(x/10);putchar(x%10+'0');return;}
int a[N];
vector<int>ans;
vector<int>g[N];
int dout[N];
void dfs(int x){

    // cout<<"x :"<<x<<'\n';
    ans.push_back(x);
    for(auto y:g[x]){
        dfs(y);
    }
}
void solve(){
    int n,m;cin>>n>>m;
    for(int i=1;i<=n;i++){
        a[i]=0;
        dout[i]=0;
    }
    ans.clear();
    for(int i=1;i<=n;i++){
        int x;cin>>x;
        for(int j=1;j<=x;j++){
            int y;cin>>y;
            if(a[y]!=0){
                dout[i]++;
                g[a[y]].push_back(i);
                a[y]=i;
            }else{
                a[y]=i;
            }
        }
    }
    if(n==1){
        cout<<"No"<<'\n';
        return;
    }
    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(int i=n;i>=1;i--){
        if(dout[i]==0){
            // cout<<i<<'\n';
            dfs(i);
        }
    }
    int flag=1;
    for(int i=0;i<ans.size();i++){
        if(ans[i]!=i+1){
            flag=0;
            break;
        }
    }
    if(flag){
        cout<<"No"<<'\n';
    }else{
        cout<<"Yes"<<'\n';
        for(auto i:ans){
            cout<<i<<" ";
        }
        cout<<'\n';
    }
}

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