import sys
from itertools import permutations
from heapq import heappop,heappush
from collections import deque
import random
import bisect

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

def solve(N,M,A):
    Q_xor = 0
    for i in range(N):
        Q_xor ^= (A[i]//M)
        A[i] %= M
    
    if Q_xor:
        return "Alice"
    
    while sum(A)!=0:
        if sum(A) & 1:
            return "Alice"
        A = [a>>1 for a in A]
    return "Bob"

N,M = mi()
A = li()
print(solve(N,M,A))