#include<bits/stdc++.h>
using namespace std;
#define FOR(i,s,t) for(int i=(s),_t=(t); i<=_t; ++i)
#define DOR(i,s,t) for(int i=(s),_t=(t); i>=_t; --i)
#define EOR(i,x) for(int i=Head[x]; ~i; i=Nxt[i])
const int N=1200,M=N*20;
int Head[N],E[M],Nxt[M],tol;
int cap[M];
void clear() {
    tol=0;
    memset(Head,-1,sizeof(Head));
}
void Edge(int x,int y,int c) {
    E[tol]=y;cap[tol]=c;Nxt[tol]=Head[x];Head[x]=tol++;
    E[tol]=x;cap[tol]=0;Nxt[tol]=Head[y];Head[y]=tol++;
}
int cur[N],dis[N];
int S,T;
bool bfs() {
    static int Q[N],l,r;
    memset(dis,-1,sizeof(dis));

    l=1;r=0;
    dis[S]=0;Q[++r]=S;
    while(l<=r) {
        int x=Q[l++];cur[x]=Head[x];
        EOR(i,x) if(cap[i] && !~dis[E[i]]) {
            dis[E[i]]=dis[x]+1;Q[++r]=E[i];
        }
    }
    return ~dis[T];
}
int dfs(int x,int left) {
    if(x==T || !left) return left;
    int flow=0,t;
    for(int &i=cur[x]; ~i; i=Nxt[i]) {
        if(dis[E[i]]==dis[x]+1 && cap[i]) {
            if(t=dfs(E[i],min(cap[i],left))) {
                cap[i]-=t;cap[i^1]+=t;
                flow+=t;left-=t;
                if(!left) return flow;
            }
        }
    }
    return flow;
}
int dinic() {
    int flow=0;
    while(bfs()) {
        flow+=dfs(S,1e9);
    }
    return flow;
}
int del[N];
int sz[N];
void solve() {
    int n,m;
    cin >> n >> m;
    string A,B;
    cin >> A >> B;
    int st=0;
    FOR(i,0,n-1) {
        if(A[i]==B[i]) st*=2;
        else st=st*2+1;
    }
    FOR(i,0,(1<<n)-1) {
        if(i) sz[i]=sz[i^(i&-i)]+1;
        del[i]=0;
    }
    while(m--) {
        cin >> A;
        cerr << A << endl;
        int v=0;
        FOR(i,0,n-1) {
            if(A[i]=='=') v*=2;
            else v=v*2+1;
        }
        del[v]=1;
    }
    clear();
    S=1<<n,T=S+1;
    FOR(i,0,(1<<n)-1) if(sz[i]%2==0) {
        FOR(j,0,n-1) Edge(i,i^(1<<j),1);
    }
    FOR(i,0,(1<<n)-1) if(sz[i]%2==0 && !del[i] && i!=st) {
        Edge(S,i,1);
    }
    FOR(i,0,(1<<n)-1) if(sz[i]%2==1 && !del[i] && i!=st) {
        Edge(i,T,1);
    }
    dinic();
    // cerr << " -- " << endl;
    if(sz[st]%2==0) Edge(S,st,1);
    else Edge(st,T,1);
    cout << (dinic()?"Alice":"Bob") << '\n';
    // cerr << " -- " << endl;
}
int main() {
    ios::sync_with_stdio(false);
    int T;
    cin >> T;
    while(T--) solve();
    return 0;
}