#include<bits/stdc++.h>
//#define int long long
//#pragma GCC optimize(3,"Ofast","inline")//bitset配合用
#define inf 0x3f3f3f3f
#define ll long long
#define pii pair<int,int>
#define db double
using namespace std;
const int maxn=1e5+10;
int top[maxn],in[maxn],dep[maxn];
vector<int>v[maxn];
vector<int>G[maxn];
vector<int>ans[maxn];
queue<int>q;
void solve(){
    int n,m;cin>>n>>m;
    for(int i=0;i<=m;i++) in[i]=0,v[i].clear(),G[i].clear(),ans[i].clear();
    swap(n,m);
    for(int i=1;i<=m;i++){
        int len;cin>>len;
        for(int j=1;j<=len;j++){
            int tem;cin>>tem;
            v[i].push_back(tem);
            top[tem]=i;
        }
    }
    for(int i=1;i<=m;i++){
        for(auto it:v[i]){
            if(top[it]!=i){
                in[top[it]]++;
                G[i].push_back(top[it]);
            }
        }
    }
    int flag=0;
    for(int i=1;i<=m;i++){
        if(!in[i]) q.push(i),ans[0].push_back(i);
    }
    if(ans[0].size()>1) flag=1;
    while(!q.empty()){
        int u=q.front();q.pop();
        for(auto v:G[u]){
            in[v]--;
            if(!in[v]){
                q.push(v);
                dep[v]=dep[u]+1;
                ans[dep[v]].push_back(v);
                if(ans[dep[v]].size()>1) flag=1;
            }
        }
    }
    if(!flag){cout<<"No"<<endl;return;}
    cout<<"Yes"<<endl;
    for(int i=0;i<=m;i++){
        if(ans[i].size()>1){
            sort(ans[i].begin(),ans[i].end());
            reverse(ans[i].begin(),ans[i].end());
        }
        for(auto it:ans[i]) cout<<it<<" ";
    }
    cout<<endl;
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    int t;cin>>t;
    while(t--) solve();
    //system("pause");
    return 0;
}