def find_winner(A, B):
    # Create a DP table where dp[a][b] means if the current position is a winning position for Alice
    dp = [[False] * 19 for _ in range(19)]  # Since A and B are in the range [1, 18], we need a table of size 19x19
    
    # Base cases:
    for b in range(19):
        dp[0][b] = False  # If Alice has 0, Bob wins.
    
    for a in range(19):
        dp[a][0] = True  # If Bob has 0, Alice wins.

    # Fill the DP table for all values of a and b from 1 to 18
    for a in range(1, 19):
        for b in range(1, 19):
            # Alice's turn:
            # 1. Alice can reduce her number by 1, so we check if dp[a-1][b] is False (Bob loses)
            if not dp[a-1][b]:
                dp[a][b] = True
            # 2. Alice can divide her number by Bob's number, if a >= b
            if a >= b and not dp[a//b][b]:
                dp[a][b] = True

    # The result is determined by the value of dp[A][B]
    return "Alice" if dp[A][B] else "Bob"

# Read inputs
A = int(input())
B = int(input())

# Print the result
print(find_winner(A, B))