#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for(int i = j;i <= k;++i)
#define repp(i,j,k) for(int i = j;i >= k;--i)
#define rept(i,x) for(int i = linkk[x];i;i = e[i].n)
#define ll long long
#define pb push_back
#define mp make_pair
#define fr first
#define se second
#define P pair<int,int>
int rd() {
	int x; scanf("%d",&x);
	return x;
}
const ll INF = 1e17;
int T,N,C;
int n,m,st;
int ST,ED;
int cnt[1050];
bool vivad[1050];
char s1[20],s2[20];

int linkk[1050] , dep[1050] , t;
struct node{int n,v,y;}e[1010000];
// st : 1<<N   end : (1<<N)+1
void insert(int x,int y) {
	e[++t].n = linkk[x]; e[t].y = y; e[t].v = 1; linkk[x] = t;
	e[++t].n = linkk[y]; e[t].y = x; e[t].v = 0; linkk[y] = t;
}
void build() {
	rep(i,0,n-2) {
		if( ! (cnt[i] & 1) ) insert( ST , i ); // ou
		else insert( i , ED );
		rep(j,0,N-1)
			if(  (cnt[( i ^ (1<<j) )]&1) > (cnt[i]&1) ) insert( i , i ^ (1<<j)  );
	}
}
void reset() {
	rep(i,0,n) vivad[i] = false;
	t = 1; rep(i,0,n) linkk[i] = 0 , dep[i] = 0;
}
void init() {
	N = rd(); C = rd();
	n = (1<<N)+1;
	ST = 1<<N; ED = n;
	reset();
	scanf("%s%s",s1+1,s2+1);
	st = 0;
	rep(i,1,N) if(s1[i] == s2[i]) st += (1<<(i-1));
	rep(i,1,C) {
		int res = 0;
		scanf("%s",s1+1);
		rep(i,1,n) if(s1[i] == '=') res += (1<<(i-1));
		vivad[res] = true;
	}
	build();
}
queue<int>q;
bool bfs() {
	rep(i,0,n) dep[i] = -1; dep[ST] = 0;
	q.push(ST);
	while(!q.empty()) {
		int x = q.front(); q.pop();
		rept(i,x) {
			int y = e[i].y;
			if( !vivad[y] && dep[y] == -1 && e[i].v > 0 )
				dep[y] = dep[x]+1 , q.push(y);
		}
	}
	return dep[ED] != -1;
}
void output() {
	rep(x,0,n) {
		printf("#%d\n",x);
		rept(i,x) printf("*%d %d\n",e[i].y,e[i].v);
		printf("\n");
	}
}
ll dfs(int x,ll lazy) {
	if(x == ED) return lazy;
	if(vivad[x]) return 0;
	ll nowlazy = 0 , d = 0;
	rept(i,x) {
		int y = e[i].y;
		if( !vivad[y] && dep[y] == dep[x]+1 && e[i].v > 0 ) 
			if( d = dfs( y  , min( 1ll*e[i].v , lazy - nowlazy ) ) ) {
				e[i].v -= d;
				e[i^1].v += d;
				nowlazy += d;
			}
	}
	if(nowlazy == 0) dep[x] = -1;
	return nowlazy;
}
void work() {
	if(vivad[st]) {
		printf("Bob\n");
		return;
	}

	ll ans1 = 0 , ans2 = 0;
	while(bfs()) {
		ll d;
		while(d=dfs(ST,INF)) ans1 += d;
	}
	t = 1; rep(i,0,n) linkk[i] = 0 , dep[i] = 0;
	vivad[st] = true;
	build();

	while(bfs()) {
		ll d;
		while(d=dfs(ST,INF)) ans2 += d;
	}
	if(ans1 != ans2) printf("Alice\n");
	else printf("Bob\n");
	//printf("**%d\n",st);
	//printf("#%d %d\n",ans1,ans2);
}
int main() {
	rep(i,0,1024) {
		int x = i;
		while(x>0) cnt[i] += (x&1) , x >>= 1;
	}
	T = rd();
	while(T--) {
		init();
		work();
	}
	return 0;
}