#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using vi = vector<int>;

#define sz(a) (int)a.size()
#define rep(i,j,k) for(int i = j; i < (k); i++)
#define all(x) x.begin(), x.end()

bool find(int j, vector<vi>& g, vi& btoa, vi& vis) {
	if (btoa[j] == -1) return 1;
	vis[j] = 1; int di = btoa[j];
	for (int e : g[di])
		if (!vis[e] && find(e, g, btoa, vis)) {
			btoa[e] = di;
			return 1;
		}
	return 0;
}
int dfsMatching(vector<vi>& g, vi& btoa) {
	vi vis;
	rep(i,0,sz(g)) {
		vis.assign(sz(btoa), 0);
		for (int j : g[i])
			if (find(j, g, btoa, vis)) {
				btoa[j] = i;
				break;
			}
	}
	return sz(btoa) - (int)count(all(btoa), -1);
}

void solve() {
    int n, c; cin >> n >> c;
    string a, b; cin >> a >> b;

    int start = 0;
    for (int i = 0; i < n; i++) {
        start += (1 << i) * (a[i] == b[i]);
    }

    // cout << start << "\n";

    vector<bool> forbidden(1 << n);
    for (int i = 0; i < c; i++) {
        string s; cin >> s;
        int x = 0;
        for (int j = 0; j < n; j++) {
            x += (1 << j) * (s[j] == '=');
        }
        forbidden[x] = true;
        // cout << x << "\n";
    }

    int pc = __popcount(start) % 2;

    vector<vi> g(1 << (n));
    for (int i = 0; i < (1 << n); i++) {
        if (__popcount(i) % 2 != pc) continue;
        if (forbidden[i]) continue;
        for (int j = 0; j < n; j++) {
            if (forbidden[i ^ (1 << j)]) continue;
            g[i].push_back(i ^ (1 << j));
        }
        // cout << i << "\n";
        // for (auto& x : g[i]) cout << x << " ";
        // cout << "\n";
    }

    vi btoa(1 << n, -1);
    int begin = dfsMatching(g, btoa);

    btoa.assign(1 << n, -1);
    g[start].clear();

    int end = dfsMatching(g, btoa);
    cout << (begin != end ? "Alice" : "Bob") << "\n";
}


int main() {
    int t; cin >> t;
    while (t--) solve();
}