#include<bits/stdc++.h>
using namespace std;
constexpr int M=5005;
vector<int>vec[M];
int n,q,a[M],cnt[M];
int read(){
	int x=0;char ch=getchar();
	while (!isdigit(ch)) ch=getchar();
	while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
	return x;
}
void solve(){
	n=read();q=read();
	for (int i=1;i<=n;i++) a[i]=read();
	for (int i=1;i<=n;i++){
		for (int j=1;j<=n;j++) cnt[j]=0;
		vec[i].clear();
		for (int j=i;j;j--){
			if (cnt[a[j]]) continue; cnt[a[j]]=1;
			vec[i].emplace_back(a[j]);
		}
		vec[i].resize(n,0);
	}
	sort(vec+1,vec+n+1); while (q--){
		int m=read();vector<int>tmp;
		for (int i=1;i<=m;i++) tmp.emplace_back(read());
		int p=lower_bound(vec+1,vec+n+1,tmp)-vec;
		for (int i=0;i<m;i++)
			if (vec[p][i]!=tmp[i])
				{puts("No");goto fail;}
		puts("Yes");
		fail:;
	}
}
int main(){int T=read();while (T--) solve();return 0;}