#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
namespace FGF {
const int N = 105;
int c[N * N], vis[N * N], col[N * N], ans, is[N * N], num;
vector<int> g[N * N];
bool dfs(int u) {
    for (auto v : g[u])
        if (!vis[v]) {
            vis[v] = 1;
            if (c[v] == -1 || dfs(c[v])) {
                c[v] = u;
                return 1;
            }
        }
    return 0;
}
void dfs2(int u) {
    if (is[u])
        return;
    is[u] = 1;
    for (auto v : g[u])
        if (c[v] != -1)
            dfs2(c[v]);
}
void work() {
    int n, c;
    scanf("%d %d", &n, &c);
    static bool vis[1100];
    memset(vis, 0, sizeof(vis));
    static char s1[10 + 10], s2[10 + 10];
    scanf("%s", s1), scanf("%s", s2);
    int Msk = 0;
    for (int i = 0; i < n; i++) Msk ^= (s1[i] == s2[i]) << i;
    vis[Msk] = true;
    while (c--) {
        static char s[10 + 10];
        scanf("%s", s);
        int msk = 0;
        for (int i = 0; i < n; i++) msk ^= (s[i] == '=') << i;
        vis[msk] = true;
    }
    static int id[1100];
    memset(id, 0, sizeof(id));
    ans = num = 0;
    for (int i = 0; i < 1 << n; i++)
        if (!vis[i])
            id[i] = ++num, col[num] = __builtin_popcount(i) & 1;
    for (int i = 1; i <= num; i++) g[i].clear();
    for (int i = 0; i < 1 << n; i++)
        for (int p = 0; p < n; p++)
            if (id[i] && id[i ^ (1 << p)])
                g[id[i]].push_back(id[i ^ (1 << p)]);
    memset(FGF::c, -1, sizeof(FGF::c));
    memset(is, 0, sizeof(is));
    for (int i = 1; i <= num; i++)
        if (col[i])
            memset(FGF::vis, 0, sizeof(FGF::vis)), ans += dfs(i);
    for (int i = 1; i <= num; i++)
        if (FGF::c[i] != -1)
            FGF::c[FGF::c[i]] = i;
    for (int i = 1; i <= num; i++)
        if (FGF::c[i] == -1)
            dfs2(i);
    bool ans = false;
    for (int p = 0; p < n; p++) {
        ans |= id[Msk ^ (1 << p)] && is[id[Msk ^ (1 << p)]];
    }
    printf(ans ? "Alice\n" : "Bob\n");
}
}  // namespace FGF
int main() {
    int t;
    scanf("%d", &t);
    while (t--) FGF::work();
    return 0;
}