#include<bits/stdc++.h>
using namespace std;

using pi = pair<int,int>;
#define sz(x) int((x).size())
template<class F> struct Dinic {
    struct Edge { int to, rev; F cap; };
    int N; vector<vector<Edge>> adj;
    void init(int _N) { N = _N; adj.resize(N); } //0-based
    pi ae(int a, int b, F cap, F rcap = 0) {
        assert(min(cap,rcap) >= 0); // saved me > once
        adj[a].push_back({b,sz(adj[b]),cap});
        adj[b].push_back({a,sz(adj[a])-1,rcap});
        return {a,sz(adj[a])-1};
    }
    F edgeFlow(pi loc) { // get flow along original edge
        const Edge& e = adj.at(loc.first).at(loc.second);
        return adj.at(e.to).at(e.rev).cap;
    }
    vector<int> lev, ptr;
    bool bfs(int s,int t){//level=shortest dist from source
        lev = ptr = vector<int>(N);
        lev[s] = 1; queue<int> q({s});
        while (sz(q)) { int u = q.front(); q.pop();
            for(auto& e: adj[u]) if (e.cap && !lev[e.to]) {
                q.push(e.to), lev[e.to] = lev[u]+1;
                if (e.to == t) return 1;
            }
        }
        return 0;
    }
    F dfs(int v, int t, F flo) {
        if (v == t) return flo;
        for (int& i = ptr[v]; i < sz(adj[v]); i++) {
            Edge& e = adj[v][i];
            if (lev[e.to]!=lev[v]+1||!e.cap) continue;
            if (F df = dfs(e.to,t,min(flo,e.cap))) {
                e.cap -= df; adj[e.to][e.rev].cap += df;
                return df; } // saturated $\geq1$ one edge
        }
        return 0;
    }
    F maxFlow(int s, int t) {
        F tot = 0; while (bfs(s,t)) while (F df =
            dfs(s,t,numeric_limits<F>::max())) tot += df;
        return tot;
    }
};

void solve(){
    int n,c;
    cin>>n>>c;
    
    string s,t;
    cin>>s>>t;
    
    int nodo=0;
    for(int i=0;i<n;i++){
        if(s[i]!=t[i])nodo+=(1<<i);
    }
    
    vector ok(1<<n,true);
    for(int i=0;i<c;i++){
        string s;
        cin>>s;
        int x=0;
        for(int j=0;j<n;j++)if(s[j]=='.')x+=(1<<j);
        ok[x]=false;
    }
    
    int source = (1<<n), sink = (1<<n)+1;
    Dinic<int> ds;
    ds.init(sink+1);
    
    for(int i=0;i<(1<<n);i++){
        if(!ok[i])continue;
        
        if(__builtin_popcount(i)%2==0){
            ds.ae(source,i,1);
            for(int j=0;j<n;j++){
                int to = i^(1<<j);
                if(!ok[to])continue;
                ds.ae(i,to,1);
            }
        }else{
            ds.ae(i,sink,1);
        }
    }
    
    int flow1 = ds.maxFlow(source,sink);
    ok[nodo]=false;
    
    ds = Dinic<int>();
    ds.init(sink+1);
    
    for(int i=0;i<(1<<n);i++){
        if(!ok[i])continue;
        
        if(__builtin_popcount(i)%2==0){
            ds.ae(source,i,1);
            for(int j=0;j<n;j++){
                int to = i^(1<<j);
                if(!ok[to])continue;
                ds.ae(i,to,1);
            }
        }else{
            ds.ae(i,sink,1);
        }
    }
    
    int flow2 = ds.maxFlow(source,sink);
    
    if(flow2==flow1)cout<<"Bob\n";
    else cout<<"Alice\n";
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int t=1;
    cin>>t;
    for(int i=1;i<=t;i++)solve();
    
    return 0;
}