Z, O = '=', '.'

def gray(n):
    if n == 1:
        return [Z, O]
    return list(map(lambda x: Z+x, gray(n-1))) + list(map(lambda x: O+x, list(reversed(gray(n-1)))))


def solve():
    n, c = map(int, input().split())
    a, b = input(), input()
    st = set()
    for _ in range(c):
        st.add(input())

    g = gray(n)
    N = 1<<n
    bad = [0]*(N)
    for i in range(N):
        bad[i] = (g[i] in st)

    i = g.index(''.join((Z if x == y else O) for x, y in zip(a, b)))
    l, r = 0, 0
    j = i
    while not bad[j]:
        j = (j-1+N)%N
        l += 1
        if l == N:
            break
    j = i
    while not bad[j]:
        j = (j+1)%N
        r += 1
        if r == N:
            break
    if (l & 1) != (r & 1):
        print("Alice")
    elif (l & 1):
        print("Bob")
    else:
        print("Alice")


for _ in range(int(input())):
    solve()