#include<iostream>
#include<cstdio>
#include<queue>
#include<stack>
#define N 2048
#define M 1000000
#define inf 1e9
using namespace std;
int read()
{
    char c=0;
    int sum=0;
    while (c<'0'||c>'9') c=getchar();
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum;
}
int lowbit(int x)
{
    return x&(-x);
}
struct node
{
    int v,data,nxt;
};
node edge[M+1];
int T,sz[N+1],depth[N+1],dfn[N+1],low[N+1],leng,n,C,len,s,t,head[N+1],cur[N+1],dis[N+1];
bool used[N+1],vis[N+1];
stack<int>p;
void add(int x,int y,int z)
{
    edge[++len]=(node){y,z,head[x]},head[x]=len;
    edge[++len]=(node){x,0,head[y]},head[y]=len;
    return;
}
bool bfs()
{
    int top;
    queue<int>q;
    for (int i=s;i<=t;++i) depth[i]=0;
    q.push(s),depth[s]=1;
    while (!q.empty())
    {
	top=q.front(),q.pop();
	for (int i=head[top];i>0;i=edge[i].nxt)
	    if (edge[i].data&&!depth[edge[i].v])
	    {
		depth[edge[i].v]=depth[top]+1,q.push(edge[i].v);
		if (edge[i].v==t) return 1;
	    }
    }
    return 0;
}
int dinic(int x,int flow)
{
    if (x==t) return flow;
    int k;
    for (int &i=cur[x];i>0;i=edge[i].nxt)
	if (edge[i].data&&depth[edge[i].v]==depth[x]+1)
	{
	    k=dinic(edge[i].v,min(flow,edge[i].data));
	    if (!k) depth[edge[i].v]=0;
	    else
	    {
		edge[i].data-=k,edge[i^1].data+=k;
		return k;
	    }
	}
    return 0;
}
int main()
{
    int x,flow,res;
    bool op;
    string sr,tr;
    T=read();
    while (T--)
    {
	n=read(),C=read(),s=0,t=(1<<n)+1,len=op=1,leng=res=0;
	for (int i=1;i<(1<<n);++i) sz[i]=sz[i-lowbit(i)]+1;
	for (int i=0;i<(1<<n);++i) used[i]=0;
	for (int i=s;i<=t;++i) head[i]=0;
	cin>>sr>>tr,x=0;
	for (int i=0;i<n;++i)
	    if (sr[i]==tr[i])
		x|=(1<<i);
	while (C--)
	{
	    cin>>sr,res=0;
	    for (int i=0;i<n;++i)
		if (sr[i]=='=')
		    res|=(1<<i);
	    used[res]=1;
	}
	for (int i=0;i<(1<<n);++i)
	    if (!used[i])
	    {
		if (!((sz[i]^sz[x])&1)) add(s,i+1,1);
		else add(i+1,t,1);
	    }
	for (int i=0;i<(1<<n);++i)
	    if ((!((sz[i]^sz[x])&1))&&!used[i])
		for (int j=0;j<n;++j)
		    if (!used[i^(1<<j)])
			add(i+1,(i^(1<<j))+1,1);
	while (bfs())
	{
	    for (int i=s;i<=t;++i) cur[i]=head[i];
	    while (flow=dinic(s,inf)) res+=flow;
	}
	puts(depth[x+1]?"Bob":"Alice");
    }
    return 0;
}