#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define SZ(a) ((int)a.size())
#define ALL(v) v.begin(), v.end()
#define pb push_back

const int MAXN = 2005;
const int INF = 1e9;
struct Dinic {
    struct Edge {
        int to, cap, flow, rev;  
    };
    vector<Edge> G[MAXN];
    int cur[MAXN], dis[MAXN], s, t, n;
    int dfs(int u, int cap) {
        if (u == t || !cap) return cap;
        for (int &i = cur[u]; i < SZ(G[u]);) {
            auto &e = G[u][i++];
            if (dis[e.to] == dis[u] + 1 && e.cap != e.flow) {
                int df = dfs(e.to, min(cap, e.cap - e.flow));
                if (df) {
                    e.flow += df;
                    G[e.to][e.rev].flow -= df;
                    return df;
                }
            }
        }
        dis[u] = -1;
        return 0;
    }
    bool bfs() {
        fill(dis, dis + n, -1);
        queue<int> q;
        q.push(s), dis[s] = 0;
        while (!q.empty()) {
            int u = q.front();
            q.pop();
            for (auto e : G[u])
                if (e.cap != e.flow && !~dis[e.to])
                    q.push(e.to), dis[e.to] = dis[u] + 1;
        }
        return dis[t] != -1;
    }
    int maxflow(int _s, int _t) {
        s = _s, t = _t;
        int flow = 0, df;
        while (bfs()) {
            fill(cur, cur + n, 0);
            while ((df = dfs(s, INF))) flow += df;
        }
        return flow;
    }
    void add_edge(int a, int b, int cap) {
        G[a].pb(Edge{b, cap, 0, SZ(G[b])});
        G[b].pb(Edge{a, 0, 0, SZ(G[a]) - 1});
    }
    void init(int _n) {
        n = _n;
        for (int i = 0; i < n; ++i)
            G[i].clear();
    }
};

void solve() {
    int n, m;
    cin >> n >> m;
    vector<int> ban(1<<n, 0);
    int init = 0;
    {
        string s, t;
        cin >> s >> t;
        for (int i = 0; i < n; i++)
            if (s[i] == t[i])
                init += (1<<i); 
    }
    while (m--) {
        string s;
        cin >> s;
        int t = 0;
        for (int i = 0; i < n; i++)
            if (s[i] == '=')
                t += (1<<i);
        ban[t] = 1;
    }
    assert(!ban[init]);
    int S = (1<<n);
    int T = (1<<n) + 1;
    Dinic flow;
    flow.init(T + 1);
    for (int i = 0; i < (1<<n); i++) {
        if (ban[i]) continue;
        int c = __builtin_popcount(i);
        if (c & 1) {
            flow.add_edge(S, i, 1);
            for (int j = 0; j < n; j++)
                if (!ban[i ^ (1<<j)])
                    flow.add_edge(i, i ^ (1<<j), 1);
        }
        else
            flow.add_edge(i, T, 1);
    }
    int mch = flow.maxflow(S, T);
    flow.init(T + 1);
    ban[init] = 1;
    for (int i = 0; i < (1<<n); i++) {
        if (ban[i]) continue;
        int c = __builtin_popcount(i);
        if (c & 1) {
            flow.add_edge(S, i, 1);
            for (int j = 0; j < n; j++)
                if (!ban[i ^ (1<<j)])
                    flow.add_edge(i, i ^ (1<<j), 1);
        }
        else
            flow.add_edge(i, T, 1);
    }
    if (mch == flow.maxflow(S, T)) cout << "Bob\n";
    else cout << "Alice\n";
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int T;
    cin >> T;
    while (T--)
        solve();
}