#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
using namespace std;
const int N=201000;
const int inf=1e9+7;
long long read(void)
{
	char ch=getchar();long long sum=0;bool f=0;
	while((ch<'0'||ch>'9')&&ch!='-')ch=getchar();
	if(ch=='-')f=1,ch=getchar();
	while(ch>='0'&&ch<='9')sum=sum*10+ch-'0',ch=getchar();
	if(f)sum=-sum;return sum;
}
int n,m,Len=1,hd,tl,S,T;
int D[N],que[N],cur[N];
vector<int>G[N];
int PC[N];
int All,o;
string st1,st2;
bool ct[N];
struct E
{
	int from,to;
	long long cap,flow;
}edge[N];
void addedge(int x,int y,int w){
	edge[++Len]=(E){x,y,w,0};G[x].push_back(Len);
	edge[++Len]=(E){y,x,0,0};G[y].push_back(Len);
	return;
}
bool BFS(void)
{
	hd=1;tl=0;
	for(int i=1;i<=T;i++)D[i]=0;que[++tl]=S;D[S]=1;
	while(hd<=tl)
	{
		int u=que[hd++];if(ct[u])continue;
		for(int i=0,p,v;i<G[u].size();i++)
		{
			p=G[u][i];v=edge[p].to;if(ct[v])continue;
			if(!D[v]&&edge[p].cap>edge[p].flow)D[v]=D[u]+1,que[++tl]=v;
		}
	}return D[T];
}
long long Dinic(int u,long long c)
{
	if(!c||u==T)return c;
	if(ct[u])return 0;
	int f=0,ff=0;
	for(int &i=cur[u],p,v;i<G[u].size();i++)
	{
		p=G[u][i];v=edge[p].to;if(ct[v])continue;
		if(D[v]==D[u]+1&&edge[p].cap>edge[p].flow)
		{
			f=Dinic(v,min(edge[p].cap-edge[p].flow,c));
			if(f){edge[p].flow+=f;edge[p^1].flow-=f;ff+=f;c-=f;if(!c)break;}
		}
	}return ff;
}
long long Maxflow(void)
{
	long long Res=0;
	while(BFS())
	{
		for(int i=1;i<=T;i++)cur[i]=0;
		Res+=Dinic(S,inf);
	}return Res;
}
void clear(void)
{
	for(int i=2;i<=Len;i++)edge[i].flow=0;
	return;
}
int lowbit(int x){
	return x&-x;
}
bool chk(int x){
	int cnt=0;
	while(x)x-=lowbit(x),cnt^=1;
	return cnt;
}

void Init(void)
{
	S=(1<<10)+1;T=(1<<10)+2;
	PC[0]=0;All=(1<<10);
	for(int i=0;i<All;i++)
	{
		if(i!=0)PC[i]=PC[i-lowbit(i)]+1;
		if(PC[i]&1){
			addedge(S,i+1,1);
			for(int j=1;j<=10;j++)
				addedge(i+1,(i^(1<<(j-1)))+1,1);
		}
		else addedge(i+1,T,1);
	}return;
}
int main()
{
	int tt=read();
	Init();
	while(tt--)
	{
		for(int i=1;i<S;i++)ct[i]=1;
		n=read();m=read();
		for(int i=1;i<=(1<<n);i++)ct[i]=0;
		cin>>st1>>st2;
		o=0;
		for(int i=1;i<=n;i++)if(st1[i-1]!=st2[i-1])o|=(1<<(i-1));++o;
		for(int i=1,t;i<=m;i++){
			cin>>st1;t=0;
			for(int j=1;j<=n;j++)
				if(st1[j-1]=='.')t|=(1<<(j-1));
			++t;
			ct[t]=1;
		}
		clear();
		int res=Maxflow();
		ct[o]=1;
		clear();
		if(res==Maxflow())puts("Bob");
		else puts("Alice");
	}
	return 0;
}
/*
1
3 1
204
101
.==

*/