import sys 

sys.setrecursionlimit(int(1e9))

T = int(input())
dx4 = [0, 1, 0, -1]
dy4 = [1, 0, -1, 0]
def solve():
    H, W, R, C = map(int, input().split())
    R, C = R - 1, C - 1
    
    g = [[0] * W for _ in range(H)]
    g[R][C] = 1

    def dfs(i, j):
        win = False
        for k in range(4):
            ni = i + dx4[k]
            nj = j + dy4[k]
            if not 0 <= ni < H: continue
            if not 0 <= nj < W: continue
            if g[ni][nj]: continue
            path = []
            while True:
                path.append((ni, nj))
                g[ni][nj] = 1
                nni = ni + dx4[k]
                nnj = nj + dy4[k]
                if not 0 <= nni < H: break
                if not 0 <= nnj < W: break
                if g[nni][nnj]: break
                ni, nj = nni, nnj
            win |= not dfs(ni, nj)
            for u,v in path:
                g[u][v] = 0
        return win

    print("Alice" if dfs(R, C) else "Bob")

for _ in range(T):
    solve()