#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define ULL unsigned long long
#define Enter putchar('\n')
#define spc putchar(' ')
#define pb push_back
#define fi first
#define se second
inline void read(int &num){num=0;int f=1;char ch=getchar();while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){num=(num<<1)+(num<<3)+(ch^48);ch=getchar();}num*=f;}
inline void lread(long long &num){num=0;int f=1;char ch=getchar();while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){num=(num<<1)+(num<<3)+(ch^48);ch=getchar();}num*=f;}
void print(long long num){if(num<0){putchar('-');num=-num;}if(num>9){print(num/10);}putchar((num%10)^48);}
vector<int> f;
set<int> g;
int id[100009];
int main(){
    int T,k,x,n,m;
    read(T);
    while(T--){
        read(n),read(m);
        read(k);
        g.clear();
        for(int i=1;i<=k;i++){
            read(x);
            g.insert(x);
        }
        int ans=0;
        id[1]=1;
        for(int i=2;i<=n;i++){
            id[i]=i;
            read(k);
            bool flag=0;
            for(int j=0;j<k;j++){
                read(x);
                f.pb(x);
                if(g.find(x)!=g.end())flag=1;
            }
            g.clear();
            for(int j=0;j<k;j++){
                g.insert(f[j]);
            }
            f.clear();
            if(!flag)ans=i;
        }
        if(ans){
            puts("Yes");
            swap(id[ans],id[ans-1]);
            for(int i=1;i<n;i++)print(id[i]),spc;
            print(id[n]);
        }
        else{
            printf("No");
        }
        if(T>=1)Enter;
    }
    return 0;
}