#include <bits/stdc++.h>
#define int long long 
using namespace std;
#define For(i,a,b) for(int i = a; i <= b; ++i)
#define pb push_back
#define mp make_pair
inline int read(){
	int x=0;
	bool f=false;
	char ch=getchar();
	while(!isdigit(ch))f=ch=='-',ch=getchar();
	while(isdigit(ch))x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
	return f?-x:x;
}
const int mod = 1e18 + 3;
const int base = 13;
const int M = 262143;
int T = 0;
struct E{int v; E * nxt;} *g[M+1],pool[M+ 2],*cur = pool, *p;
struct hashMap{
		int vis[M + 1];
		void ins(int v){
			int u = v & M;
			if(vis[u] < T) vis[u] = T ,g[u] = NULL;
			for(p = g[u]; p ; p = p -> nxt)
				if(p -> v == v) 
					return;
			p = cur ++;
			p -> v = v;
			p -> nxt = g[u];
			g[u] = p;

		}
		int ask(int v){
			int u = v & M;
			if(vis[u] < T) return 0;
			for(p = g[u] ; p ; p = p -> nxt) if(p -> v == v) return 1;
			return 0;
		}
		void init(){
			T++;
			cur = pool;
		}
		
};
int mul(int x,int y){
	int t = x * y - (1.L) * (x * y / mod);
	return (t % mod + mod) % mod;
}

signed main(){
#ifdef NICEGUODONG
	freopen("data.in","r",stdin);
#endif
	int T;
	T =read();
	while(T--){
		int n,q;
		hashMap m;
		m.init();
		n = read() ,q = read();
		vector<int> a;
		For(i,1,n){
			int x;
			x = read();
			++x;
			a.push_back(x);
			int hashsum = 0,cur = 1,cnt = 0;
			vector<int> vis(n + 1);
			for(int j = a.size() - 1; j >= 0; --j){
				if(vis[a[j]]) continue;
				++cnt;
				vis[a[j]] = 1;	
				hashsum += mul(cur,a[j]);
				hashsum %= mod;
				m.ins(hashsum);
//				M[hashsum] = true;
				cur = mul(cur,base);
			}
			while(cnt <= n){
				hashsum += cur;
				hashsum %= mod;
				m.ins(hashsum);
				//M[hashsum] = true;
				cur = mul(cur,base);
				++cnt;
			}
		}
		for(int i = 1; i <= q; ++i){
			int r;
			r = read();
			int hashsum = 0,cur = 1;
			for(int i = 1; i <= r; ++i){
				int x;
				x = read();
				++x;
				hashsum += mul(cur , x);
				hashsum %= mod;
				cur = mul(cur , base);
			}
			if(m.ask(hashsum)){
				puts("Yes");
			}
			else 
				puts("No");
		}
	}

}