#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N,M,A[202020];

int gr[101][101];

int G(int cur,int x) {
	if(gr[cur][x]!=-1) return gr[cur][x];
	
	set<int> V;
	int i;
	for(i=1;i<=cur;i++) if(i%M<=x) V.insert(G(cur-i,i%M));
	gr[cur][x]=0;
	while(V.count(gr[cur][x])) gr[cur][x]++;
	return gr[cur][x];
	
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>M;
	int nim=0;
	FOR(i,N) {
		cin>>A[i];
		nim^=A[i]/M;
	}
	
	if(nim) {
		assert(0);
	}
	else {
		cout<<"Bob"<<endl;
	}
	
	/*
	MINUS(gr);
	for(i=1;i<=N;i++) {
		FOR(j,M) cout<<G(i,j)<<" ";
		cout<<endl;
	}
	*/
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}