#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define OPFI(x) freopen(#x".in", "r", stdin);\
                freopen(#x".out", "w", stdout)
#define REP(i, a, b) for(int i=(a); i<=(b); ++i)
#define REPd(i, a, b) for(int i=(a); i>=(b); --i)
inline ll rd(){
    ll r=0, k=1; char c; while(!isdigit(c=getchar())) if(c=='-') k=-k;
    while(isdigit(c)) r=r*10+c-'0', c=getchar(); return r*k;
}
constexpr int N=1e5+10;
ll t, n, m, lst[N], in[N];
vector<int> g[N];
ll ans[N];
int main(){
    t=rd();
    while(t--){
        n=rd(), m=rd();
        REP(i, 1, n) in[i]=0, g[i].clear(), ans[i]=0;
        REP(i, 1, m) lst[i]=0;
        REP(i, 1, n){
            ll p=rd();
            while(p--){
                ll a=rd();
                if(lst[a]){
                    g[lst[a]].push_back(i);
                    ++in[i];
                }
                lst[a]=i;
            }
        }
        ll cnt=0;
        priority_queue<int> q;
        REP(i, 1, n)
            if(!in[i]) q.push(i);
        while(!q.empty()){
            int u=q.top(); q.pop();
            ans[++cnt]=u;
            for(int x:g[u]){
                --in[x];
                if(in[x]==0) q.push(x);
            }
        }
        int flag=false;
        REP(i, 1, n) if(ans[i]!=i) flag=true;
        if(flag){
            puts("Yes");
            REP(i, 1, n) printf("%lld ", ans[i]);
            puts("");
        }else puts("No");
    }
    return 0;
}