#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=2e5+5,M=N*4+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(263082);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
}using namespace Debug;
int n,m,A[N],len[N],ti[N];vector<int> S[N];
void print(int x){
	puts("Yes");
	for(int i=1;i<=m;i++){
		if(i==x) printf("%d",x+1);
		else if(i==x+1) printf("%d",x);
		else printf("%d",i);
		printf("%c"," \n"[i==m]);
	}
}
void Solve(){
	int i,j;scanf("%d%d",&m,&n);
	for(i=1;i<=m;i++){
		scanf("%d",&len[i]);
		S[i].clear();S[i].resize(len[i]);
		for(j=0;j<len[i];j++) scanf("%d",&S[i][j]),A[S[i][j]]=j+1;
	}
	fill(ti+1,ti+n+1,0);
	for(i=m;i;i--){
		int mi=INF;
		for(j=0;j<len[i];j++){
			if(A[S[i][j]]^j+1) mi=min(mi,ti[S[i][j]]);
			else {
				if(!ti[S[i][j]]) ti[S[i][j]]=i;
			}
		} 
		if(i^m&&mi>i+1) return print(i);
	}
	puts("No");
}
int main(){
	int t=1;
	scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}