#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
#define all(x) x.begin(),x.end()
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=5e3+5,M=N*4+5,K=1000+5,mod=1e8+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(28382);
#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...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,q,A[N],B[N];
int gpre[N],gnxt[N];
int pre[N],nxt[N];
int tot;
void calc(int x,int w){
	tot+=w*(nxt[x]==gnxt[x]);
	tot+=w*(pre[x]==gpre[x]);
}
void del(int x){
	calc(x,-1);calc(pre[x],-1);calc(nxt[x],-1);
	nxt[pre[x]]=nxt[x];pre[nxt[x]]=pre[x];
	calc(pre[x],1);calc(nxt[x],1);
	nxt[x]=pre[x]=-1;
	calc(x,1);
}
void ins(int x,int y){
	calc(x,-1);calc(nxt[x],-1);calc(y,-1);
	pre[y]=x;nxt[y]=nxt[x];
	nxt[pre[y]]=pre[nxt[y]]=y;
	calc(y,1);calc(pre[y],1);calc(nxt[y],1);
}
void qry(){
	int lim;scanf("%d",&lim);
	for(int i=1;i<=lim;i++) scanf("%d",&B[i]);
	for(int i=0;i<=n+1;i++) gpre[i]=gnxt[i]=-1;
	int La=0,cnt=0;
	for(int i=1;i<=lim;i++) if(B[i]){
		int x=B[i];
		if(~gpre[x]){puts("No");return;}
		gpre[x]=La;gnxt[La]=x;La=x;
	}
	gpre[n+1]=La;gnxt[La]=n+1;
	for(int i=0;i<=n+1;i++) pre[i]=nxt[i]=-1;
	nxt[0]=n+1;pre[n+1]=0;
	tot=0;
	for(int i=0;i<=n+1;i++) calc(i,1);
	// gdb(tot);
	int cts=0;
	if(tot==2*(n+2)){puts("Yes");return;}
	for(int i=1;i<=n;i++){
		int x=A[i];
		if(pre[x]==-1){
			if(cts==lim){
				int y=pre[n+1];
				del(y);
				cts--;
			}
			ins(0,x);cts++;
		}else{
			del(x);
			ins(0,x);
		}
		// gdb(tot);
		if(tot==2*(n+2)){puts("Yes");gdb(i);return;}
	}
	puts("No");
}
void Solve(){
	scanf("%d%d",&n,&q);
	for(int i=1;i<=n;i++) scanf("%d",&A[i]);
	while(q--) qry();
}
int main(){
	int t=1;
	scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}