import itertools

memo = {}


def f(m, x, A):
    A.sort()
    tup = (m, x, tuple(A))
    if tup in memo:
        return memo[tup]

    se = set()
    for i in range(len(A)):
        ai = A[i]
        for k in range(1, ai + 1):
            A[i] = ai - k
            if k % m <= x:
                se.add(f(m, k % m, A[:]))
        A[i] = ai

    mex = 0
    while mex in se:
        mex += 1

    memo[tup] = mex
    return mex


def g(m, A):
    x = 0
    y = 0
    for a in A:
        x ^= a // m
        y ^= a % m

    if x != 0 or y != 0:
        return True
    else:
        return False


n, m = map(int, input().split())
A = list(map(int, input().split()))
if g(m, A):
    print("Alice")
else:
    print("Bob")


# n = 5
# m = 5
# ma = 4 * m + 1

# for P in itertools.combinations_with_replacement(range(1, ma), n):
#     ret = f(m, m - 1, list(P))
#     print(P, ret)
#     if ret == 0:
#         assert not g(m, list(P))
#     else:
#         assert g(m, list(P))