#include using namespace std; #define pb emplace_back #define mp make_pair using ll = long long; using pii = pair; constexpr int mod = 998244353; constexpr int inf = 0x3f3f3f3f; constexpr int N = 2e5 + 10; int n, m, a[N]; bool ok(int p){ int s = 0; for(int i=1; i<=n; ++i){ s ^= (a[i] / p); } return s; } void _main(){ cin >> n >> m; for(int i=1; i<=n; ++i) cin >> a[i]; sort(a + 1, a + 1 + n); for(int i=1; i<=100 && i<=m; ++i){ if(ok(i)){ cout << "Alice\n"; return; } } if(m > 100 && a[n] > 100){ cout << "Alice\n"; } else { cout << "Bob\n"; } } int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); _main(); return 0; }