//
// Created by 86189 on 2023/5/3.
//

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>

#define N 1100
using namespace std;
int two[12] = {1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048};
int bz[N], n, m;
int a[N], b[N];
char s[N];

void input() {
    int len = 0;
    char c = getchar();
    while (c < '0' || c > '9')c = getchar();
    while (c >= '0' && c <= '9') {
        s[++len] = c;
        c = getchar();
    }
}

void inp() {
    int len = 0;
    char c = getchar();
    while (c != '=' && c != '.')c = getchar();
    while (c == '=' || c == '.') {
        s[++len] = c;
        c = getchar();
    }
}

bool dfs(int ch, int sta) {
    int o = 0;
    for (int i = 0; i < n; i++) {
        int p = sta ^ two[i];
        if (bz[p])continue;
        o = 1;
        bz[p]=1;
        bool b = dfs(ch ^ 1, p);
        bz[p]=0;
        if (!b)return true;
    }
    return false;
}

int main() {
    int T;
    scanf("%d", &T);
    while (T--) {
        memset(bz, 0, sizeof(bz));
        scanf("%d%d", &n, &m);
        int ini = 0;
        input();
        for (int i = 1; i <= n; i++)a[i] = s[i] - '0';
        input();
        for (int i = 1; i <= n; i++)b[i] = s[i] - '0';
        for (int i = 1; i <= n; i++) {
            if (a[i] == b[i])
                ini ^= two[i - 1];
        }
        bz[ini]=1;
        for (int i = 1; i <= m; i++) {
            inp();
            int t = 0;
            for (int j = 1; j <= n; j++) {
                if (s[j] == '=')t ^= two[j - 1];
            }
            bz[t] = 1;
        }
        bool ans = dfs(1, ini);
        if(!ans)printf("Bob\n");
        else printf("Alice\n");
    }
}