#include<bits/stdc++.h>
using namespace std;
#define ull unsigned long long
const int N=5010,P=13331;
unordered_map<ull,bool> H[N],H1[N];
vector<int> s;
int T,n,q,a[N];

bool find_site(vector<ull> &s,ull h)
{
	auto t=lower_bound(s.begin(),s.end(),h);
	if(t!=s.end() && (*t)==h) return 1;
	return 0;
}

int main(void)
{
	scanf("%d",&T);
	while(T--)
	{
		for(int i=1;i<=n;i++) H[i].clear(),H1[i].clear();
		scanf("%d%d",&n,&q);
		for(int i=1,x;i<=n;i++) 
		{
			scanf("%d",&x);
			auto t=s.begin();
			while(t!=s.end())
			{
				if((*t)==x) {s.erase(t);break;}
				t++;
			}
			s.push_back(x);
			ull hh=0;
			for(int j=s.size()-1;j>=0;j--) hh=hh*P+s[j],H[s.size()-j][hh]=1;
			H1[s.size()][hh]=1;
		}
		//for(int i=1;i<=n;i++) sort(H[i].begin(),H[i].end()),sort(H1[i].begin(),H1[i].end());
		while(q--)
		{
			int m,len;
			bool flag=0;
			ull hh=0;
			scanf("%d",&m);len=m;
			while(m--)
			{
				int x;
				scanf("%d",&x);
				if(!x) {len--;flag=1;continue;}
				hh=hh*P+x;
			}
			if(flag)
			{
				if(H1[len].count(hh)) puts("Yes");
				else puts("No");
			}
			else
			{
				if(H[len].count(hh)) puts("Yes");
				else puts("No");
			}
		}
	}

	return 0;
}