#include <bits/stdc++.h>
using namespace std;
constexpr int N = 2e3 + 5;
constexpr int M = 2e4 + 5;
int n, c, msk, ban[N];
string a, b;
struct flow {
  int cnt = 1, hd[N], nxt[M << 1], to[M << 1], limit[M << 1];
  void clear() {memset(hd, 0, sizeof(hd)), cnt = 1;}
  void add(int u, int v, int w) {
    nxt[++cnt] = hd[u], hd[u] = cnt, to[cnt] = v, limit[cnt] = w;
    nxt[++cnt] = hd[v], hd[v] = cnt, to[cnt] = u, limit[cnt] = 0;
  }
  int cur[N], dis[N], T;
  int dfs(int id, int res) {
    if(id == T) return res;
    int flow = 0;
    for(int i = cur[id]; i && res; i = nxt[i]) {
      cur[id] = i;
      int c = min(limit[i], res), it = to[i];
      if(dis[id] + 1 == dis[it] && c) {
        int k = dfs(it, c);
        flow += k, res -= k, limit[i] -= k, limit[i ^ 1] += k;
      }
    }
    if(!flow) dis[id] = -1;
    return flow;
  }
  int maxflow(int s, int t) {
    int flow = 0;
    T = t;
    while(1) {
      queue<int> q;
      memcpy(cur, hd, sizeof(cur));
      memset(dis, -1, sizeof(dis));
      dis[s] = 0, q.push(s);
      while(!q.empty()) {
        int t = q.front();
        q.pop();
        for(int i = hd[t]; i; i = nxt[i])
          if(dis[to[i]] == -1 && limit[i])
            dis[to[i]] = dis[t] + 1, q.push(to[i]);
      }
      if(dis[t] == -1) return flow;
      flow += dfs(s, N);
    }
  }
} g;
int calc() {
  g.clear();
  int S = N - 2, T = N - 1;
  for(int i = 0; i < 1 << n; i++) {
    if(ban[i]) continue;
    if(__builtin_popcount(i) & 1) g.add(i, T, 1);
    else {
      g.add(S, i, 1);
      for(int j = 0; j < n; j++) {
        int to = i ^ (1 << j);
        if(!ban[to]) g.add(i, to, 1);
      }
    }
  }
  return g.maxflow(S, T);
}
void solve() {
  cin >> n >> c >> a >> b, msk = 0;
  for(int i = 0; i < n; i++) if(a[i] == b[i]) msk |= 1 << i;
  memset(ban, 0, sizeof(ban));
  while(c--) {
    cin >> a;
    int S = 0;
    for(int i = 0; i < n; i++) if(a[i] == '=') S |= 1 << i;
    ban[S] = 1;
  }
  int c = calc();
  ban[msk] = 1;
  if(c != calc()) cout << "Alice\n";
  else cout << "Bob\n";
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  #ifdef ALEX_WEI
    FILE* IN = freopen("1.in", "r", stdin);
    FILE* OUT = freopen("1.out", "w", stdout);
  #endif
  int T;
  cin >> T;
  while(T--) solve();
  cerr << 1e3 * clock() / CLOCKS_PER_SEC << " ms\n";
  return 0;
}
/*
g++ B.cpp -o B -std=c++14 -O2 -DALEX_WEI
*/