#include <bits/stdc++.h>
#define cs const
#define pb push_back
using namespace std;
using pi = pair <int, int> ; 
using ll = long long;
cs int N = 1050;  

int T, n, C;  
char a[N], b[N];
bool ban[N];

using Set = bitset <N> ; 
Set edge [N];

bool dfs(int x, Set & unvis, vector <int> & match) {
    for(Set z = edge[x]; ; ) {
        z &= unvis; 
        int y = z._Find_first();
        if(y == N) return 0; 
        if(unvis.reset(y), !match[y] || dfs(match[y], unvis, match)) {
            return match[y] = x, 1; 
        }
    }
}
int match (int nl, int nr) {
    Set unvis; 
    unvis.set();
    vector <int> match(nr + 1), ret(nl + 1);
    int ans = 0; 
    for(int i = 1; i <= nl; i++) 
        if(dfs(i, unvis, match))
            unvis.set(), ++ ans; 
    return ans; 
}


void Main() {
    scanf("%d%d", &n, &C);
    scanf("%s%s", a, b);
    int S = 0; 
    for(int i = 0; i < n; i++) 
        S = S << 1 | (a[i] == b[i]);
    for(int i = 0; i < C; i++) {
        int x = 0; 
        scanf("%s", a);
        for(int j = 0; j < n; j++) 
            x = x << 1 | (a[j] == '=');
        ban[x] = 1; 
    }
    for(int i = 0; i < (1 << n); i++) 
    if(!ban[i] && __builtin_popcount(i) & 1) {
        for(int j = 0; j < n; j++) {
            int v = i ^ (1 << j);
            if(!ban[v]) edge[i][v] = 1; 
        }
    }
    int cnt = match(1 << n, 1 << n);
    for(int j = 0; j < n; j++) {
        int v = S ^ (1 << j);
        edge[v][S] = edge[S][v] = 0; 
    }
    int cnt2 = match(1 << n, 1 << n);
    if(cnt == cnt2) {
        puts("Bob");
    }
    else {
        puts("Alice");
    }
    for(int i = 0; i < (1 << n); i++) 
        edge[i].reset();
}

int main() {
    #ifdef zqj
    freopen("1.in","r",stdin);
    #endif

    cin >> T; 
    while(T--) Main();
    return 0;
}