#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=1e6+5,M=N*4+5,K=1000+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const int INF=2e9+7;mt19937 rnd(time(0));
#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,m,k;char s[N];
int merge(int x,int y){
	if(!x||!y) return x|y;
	if(x==y) return x;
	return -1;
}
namespace ACAM{
	int son[N][2],ZJAKIOI;
	int w[N],val[N];
	int cnt=1,fail[N];
	int flag[N];
	vector<int> S[N];
	int vis[N][3];
	void clr(){
		for(int i=1;i<=cnt;i++){
			w[i]=0;
			fail[i]=0;
			Me(son[i],0);
			flag[i]=0;
			S[i].clear();
			Me(vis[i],0);
			val[i]=0;
		}
		cnt=1;ZJAKIOI=0;
	}
	void insert(char *s,int op){
		int k=strlen(s+1);
		int x=1;
		for(int i=1;i<=k;i++){
			if(!son[x][s[i]-'0']) son[x][s[i]-'0']=++cnt;
			x=son[x][s[i]-'0'];
		}
		if(op) w[x]=merge(w[x],op);
		else flag[x]=1;
	}
	void push(int x,int La){
		for(int i:S[x]){
			w[i]=merge(w[i],w[x]);
			flag[i]|=flag[x];
			push(i,x);
		}
	}
	void dfs(int x,int ws){
		if(flag[x]||ZJAKIOI) return;
		val[x]=ws=merge(val[x],ws);
		int op=0;
		if(ws==-1) op=2;
		else if(ws>0)op=1;
		if(vis[x][op]) return;
		vis[x][op]=1;
		if(w[x]==-1) ZJAKIOI=1;
		if(w[x]&&ws&&w[x]^ws) ZJAKIOI=1;
		ws=merge(ws,w[x]);
		for(int i:son[x]) dfs(i,ws);
	}
	int build(){
		queue<int> q;
		for(int i=0;i<2;i++){
			if(son[1][i]) q.push(son[1][i]),fail[son[1][i]]=1;
			else son[1][i]=1;
		}
		while(!q.empty()){
			int x=q.front();q.pop();
			for(int i=0;i<2;i++){
				if(son[x][i]) fail[son[x][i]]=son[fail[x]][i],q.push(son[x][i]);
				else son[x][i]=son[fail[x]][i];
			}
		}
		for(int i=2;i<=cnt;i++) S[fail[i]].push_back(i);
		push(1,0);
		dfs(1,0);
		return ZJAKIOI;
	}
}
void Solve(){
	int i,j;scanf("%d%d",&n,&m);
	ACAM::clr();
	for(i=1;i<=n;i++){
		scanf("%s",s+1);
		ACAM::insert(s,i);
	}
	for(i=1;i<=m;i++){
		scanf("%s",s+1);
		ACAM::insert(s,0);
	}
	puts(ACAM::build()?"Yes":"No");
}
int main(){
	int t=1;
	scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}