#include <bits/stdc++.h>

using i64 = long long;

void solve() {
	int N, C;
	std::cin >> N >> C;

	std::string A, B;
	std::cin >> A >> B;

	std::vector<bool> forbid(1 << N);
	for (int i = 0; i < C; i++) {
		int x = 0;
		std::string S;
		std::cin >> S;
		for (int j = 0; j < N; j++) {
			x |= (S[j] == '.') << j;
		}
		forbid[x] = true;
	}

	int s = 0;
	for (int i = 0; i < N; i++) {
		s |= (A[i] != B[i]) << i;
	}

	std::vector<int> match(1 << N, -1);
	std::vector<bool> vis(1 << N);

	std::function<bool(int)> find = [&](int x) {
		vis[x] = true;
		for (int i = 0; i < N; i++) {
			int y = x ^ (1 << i);
			if (forbid[y]) {
				continue;
			}
			if (match[y] == -1 || (!vis[match[y]] && find(match[y]))) {
				match[x] = y;
				match[y] = x;
				return true;
			}
		}
		return false;
	};

	for (int i = 0; i < (1 << N); i++) {
		if (forbid[i] || __builtin_parity(s ^ i) || i == s) {
			continue;
		}
		if (find(i)) {
			vis.assign(1 << N, false);
		}
	}

	if (find(s)) {
		std::cout << "Alice\n";
	} else {
		std::cout << "Bob\n";
	}
}

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);

	int T;
	std::cin >> T;

	while (T--) {
		solve();
	}

	return 0;
}