#include <bits/stdc++.h>
using namespace std;
int nums[2000005];
struct EDGE{
    int to, nt;
}edge[4000005];
int head[2000005];
int in[2000005];
int out[2000005];
int cnt = 0;


void add_edge(int u , int v ){
    edge[++cnt] = {v , head[u]};
    head[u] = cnt;
}

int ans[2000005];
set<pair<int ,int> >st;

int anspos= 0;
int ansval =0;

int n , m , opnum , tmppos;

bool dfs(int id){
    if(id == m+1){
        return false;
    }
    int nextid = id+1;
    int ret = false;
    for(int i = head[id] ; i ; i=edge[i].nt){
        int v = edge[i].to;
        if(--in[v] == 0){
            if(nextid == v){
                continue;
            }else{
                anspos = nextid;
                ansval = v;
                ret = 1;
                break;
            }
        }
    }
    if(ret){
        return true;
    }else{
        return dfs(nextid);
    }
}

void solve(){
    anspos= 0;
    ansval =0;
    st.clear();
    cnt = 0;
    cin >> n >> m;
    for(int i = 1;i<=m;i++){
        nums[i] = 0;
        head[i] = 0;
    }
    for(int i = 1;i<=n;i++){
        cin >> opnum;
        for(int j = 1;j<=opnum;j++){
            cin >> tmppos;
            if(nums[tmppos] == 0){
                nums[tmppos] = i;
            }else{
                int be = nums[tmppos];
                int af = i;
                if(st.find(make_pair(be , af)) == st.end()) {
                    add_edge(be , af);
                    st.insert(make_pair(be , af));
                    //cout << "add_edge" << be <<" " << af << endl;
                    in[af]++;
                    out[be]++;
                }
                nums[tmppos] = af;
            }
        }
    }
    //拓扑
    int errid = 0;
    for(int i = 1;i<=n;i++){
        ans[i] = i;
    }
    for(int i = 1;i<=n;i++){
        if(in[i] == 0){
            if(i != 1){
                errid = i;
                break;
            }
        }
    }
    if(errid != 0){
        cout << "Yes" <<'\n';
        cout << errid << " ";
        for(int i = 1;i<=n;i++){
            if(ans[i] == errid)continue;
            cout << ans[i] << " ";
        }
        cout << "\n";
        return;
    }
    
    if(dfs(1) == true){
        cout << "Yes" <<'\n';
        for(int i = 1;i<=n;i++){
            if(i == ansval ){
                continue;
            }
            if(i == anspos){
                cout << ansval << " ";
            }
            cout << i <<" ";
        }
        cout << "\n";
    }else{
        cout << "No" << '\n';
    }
    
}




int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin >> t;
    while(t--){
        solve();
    }
}