#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <array>
#include <cmath>
#include <atcoder/modint>
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(i64 i=0; i<(i64)(n); i++)
#define repr(i,n) for(i64 i=(i64)(n)-1; i>=0; i--)
const i64 INF = 1001001001001001001;
const char* yn(bool x){ return x ? "Yes" : "No"; }
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
template<typename A> using nega_queue = std::priority_queue<A,std::vector<A>,std::greater<A>>;
using Modint = atcoder::static_modint<998244353>;
using namespace std;

void testcase(){
    i64 N, M; cin >> N >> M;
    vector<i64> A(N); rep(i,N) cin >> A[i];
    auto firstWin = [](bool x) -> string { return x ? "Alice\n" : "Bob\n"; };
    sort(A.rbegin(), A.rend());
    if(N == 1){
        cout << firstWin(true);
        return;
    }
    if(A[0] >= M){
        i64 nim = 0;
        rep(i,N) nim ^= A[i] / M;
        if(nim != 0){ cout << firstWin(true); return; }
        rep(i,N) A[i] %= M;
    }
    sort(A.begin(), A.end());
    i64 sum = 0;
    while(sum % 2 == 0){
        sum = 0;
        rep(i,N) sum += A[i];
        if(sum == 0){ cout << firstWin(false); return; }
        rep(i,N) A[i] /= 2;
    }
    cout << firstWin(true);
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    #ifdef NACHIA
    int T; cin >> T; for(int t=0; t<T; T!=++t?(cout<<'\n'),0:0)
    #endif
    testcase();
    return 0;
}