#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define fi first
#define se second
const int INF = 1e9;
const int MAX_N = 1 << 10 | 5;
struct Graph { int to, cap, next; } e[MAX_N * MAX_N];
int fir[MAX_N], e_cnt;
void clearGraph() {
	memset(fir, -1, sizeof(fir));
	e_cnt = 0;
}
void Add_Edge(int u, int v, int c) {
	e[e_cnt] = (Graph){v, c, fir[u]}, fir[u] = e_cnt++;
	e[e_cnt] = (Graph){u, 0, fir[v]}, fir[v] = e_cnt++;
}
int N, C;
int S, T, iter[MAX_N], level[MAX_N];
bool bfs() {
	queue<int> que;
	for (int i = 0; i <= T; i++) iter[i] = fir[i], level[i] = -1;
	level[S] = 0, que.push(S);
	while (!que.empty()) {
		int x = que.front(); que.pop();
		for (int i = fir[x]; ~i; i = e[i].next) {
			int v = e[i].to; if (~level[v] || !e[i].cap) continue;
			level[v] = level[x] + 1, que.push(v);
		}
	}
	return ~level[T];
}
int dfs(int x, int f) {
	if (x == T || !f) return f;
	int res = 0;
	for (int &i = iter[x]; ~i; i = e[i].next) {
		int v = e[i].to;
		if (e[i].cap && level[v] == level[x] + 1) {
			int d = dfs(v, min(f, e[i].cap));
			if (d) {
				e[i].cap -= d, e[i ^ 1].cap += d;
				f -= d, res += d;
				if (!f) break;
			}
		}
	}
	if (!res) level[x] = -1;
	return res;
}
int dinic() {
	int res = 0;
	while (bfs()) res += dfs(S, INF);
	return res;
}
int ban[MAX_N];
char A[MAX_N], B[MAX_N];
vector<int> v1, v2;
void build() {
	clearGraph();
	for (int s : v1) {
		if (ban[s]) continue;
		Add_Edge(S, s, 1);
		for (int i = 0; i < N; i++)
			if (!ban[s ^ (1 << i)]) Add_Edge(s, s ^ (1 << i), 1);
	}
	for (int t : v2) {
		if (ban[t]) continue;
		Add_Edge(t, T, 1);
	}
}
void solve() {
	memset(ban, 0, sizeof(ban));
	v1.clear(), v2.clear();
	scanf("%d %d", &N, &C);
	scanf("%s %s", A, B);
	for (int i = 0; i < 1 << N; i++)
		if (__builtin_popcount(i) & 1) v1.push_back(i);
		else v2.push_back(i);
	for (int i = 1; i <= C; i++) {
		char str[15]; scanf("%s", str);
		int sta = 0;
		for (int j = 0; j < N; j++)
			sta |= (str[j] == '=') << j;
		ban[sta] = 1;
	}
	S = 1 << N, T = S + 1;
	build();
	int m1 = dinic();
	int now = 0;
	for (int i = 0; i < N; i++)
		now |= (A[i] == B[i]) << i;
	ban[now] = 1;
	build();
	int m2 = dinic();
	if (m1 != m2) puts("Alice");
	else puts("Bob");
}
int main() {
	int T; scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}