#include <bits/stdc++.h>

using namespace std;

using LL = long long;

constexpr int N = 10;

int n;
int matched[1 << N];
bool canuse[1 << N];
bool vis[1 << N];

bool left(unsigned u)
{
    return popcount(u) % 2 == 0;
}

bool dfs(int u)
{
    if (vis[u])
        return false;
    vis[u] = true;
    for (int i = 0; i < n; ++i)
    {
        int v = u ^ (1 << i);
        if (canuse[v] && (matched[v] == -1 || dfs(matched[v])))
        {
            matched[v] = u;
            return true;
        }
    }
    return false;
}

int max_match()
{
    int res = 0;
    fill_n(matched, 1 << n, -1);
    for (int i = 0; i < (1 << n); ++i)
    {
        if (left(i) && canuse[i])
        {
            fill_n(vis, 1 << n, false);
            if (dfs(i))
                ++res;
        }
    }
    return res;
}

void solve()
{
    int m;
    cin >> n >> m;
    int start = 0;
    string s1, s2;
    cin >> s1;
    cin >> s2;
    for (int i = 0; i < n; ++i)
    {
        if (s1[i] == s2[i])
            start |= 1 << i;
    }
    fill_n(canuse, 1 << n, true);
    for (int i = 0; i < m; ++i)
    {
        string s;
        cin >> s;
        int cur = 0;
        for (int i = 0; i < n; ++i)
        {
            if (s[i] == '=')
                cur |= 1 << i;
        }
        canuse[cur ^ start] = false;
    }
    int match1 = max_match();
    canuse[0] = false;
    int match2 = max_match();
    if (match1 == match2)
    {
        cout << "Bob\n";
    }
    else
    {
        cout << "Alice\n";
    }
}

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

    int T;
    cin >> T;
    while (T--)
    {
        solve();
    }
}