#pragma clang diagnostic push
#pragma ide diagnostic ignored "cert-err34-c"
#include <bitset>
#include <unordered_set>

using namespace std;
typedef bitset<10> GameState;
int n;

void RunCase();
bool IsWin(unordered_set<GameState>& forbidStates, const GameState& current);

int main() {
    int t;
    scanf("%d", &t);
    for (int i = 0; i < t; ++i) {
        RunCase();
    }
}

void RunCase() {
    int c;
    scanf("%d %d", &n, &c);
    char s1[n], s2[n];
    scanf("%s", s1);
    scanf("%s", s2);
    GameState start;
    for (int i = 0; i < n; ++i) {
        if (s1[i] == s2[i]) {
            start.set(i, true);
        }
    }
    unordered_set<GameState> forbidStates;
    for (int i = 0; i < c; ++i) {
        scanf("%s", s1);
        GameState state;
        for (int j = 0; j < n; ++j) {
            if (s1[j] == '=') {
                state.set(j, true);
            }
        }
        forbidStates.insert(state);
    }
    if (IsWin(forbidStates, start)) {
        printf("Alice\n");
    } else {
        printf("Bob\n");
    }
}

GameState* GetNextStates(const GameState& current) {
    auto* nextStates = new GameState[n];
    for (int i = 0; i < n; ++i) {
        nextStates[i] = current;
        nextStates[i].flip(i);
    }
    return nextStates;
}

bool IsWin(unordered_set<GameState>& forbidStates, const GameState& current) { // NOLINT(misc-no-recursion)
    forbidStates.insert(current);
    auto nextStates = GetNextStates(current);
    for (int i = 0; i < n; ++i) {
        auto next = nextStates[i];
        if (forbidStates.contains(next)) {
            continue;
        }
        // next person loses
        if (!IsWin(forbidStates, next)) {
            forbidStates.erase(current);
            return true;
        }
    }
    // all possible next states are lose or impossible
    forbidStates.erase(current);
    return false;
}
#pragma clang diagnostic pop