#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cctype>
// #include<cmath>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>

using namespace std;

#define IOS ios::sync_with_stdio(false); cin.tie(0), cout.tie(0);
#define ll long long
#define ull unsigned long long 
#define endl '\n'

typedef pair<char, int> pir;
const int mod = 0x7f7f7f7f;
const int N = 100010;

int x0, x1, y0, y1;
bool flag;

int main(void){
    IOS
	
	int n, k; cin >> n >> k;
	string s; cin >> s;
	
	 if(s[0] == '0') {
	 	flag = false; x0 ++ ;
	 } else {
	 	flag = true; x1 ++ ;
	 }
	 
	 for(int i = 1; i < s.size(); i ++ ) {		//计算连续相同子字符串的长度及个数
	 	if(s[i] == '0' && !flag) {
	 		x0 ++ ;
	 		if(x0 > k) {
	 			x0 -= k; y0 ++ ;
			 }
		 } else if(s[i] == '0' && flag) {
		 	y1 ++ ;
		 	x1 = 0;
		 	x0 ++ ;
		 	flag = false;
		 } else if(s[i] == '1' && flag) {
		 	x1 ++ ;
		 	if(x1 > k) {						//若长度大于k，它就相当于2个及以上的字符串，不能当作一个，因为无法一次翻转
		 		x1 -= k; y1 ++ ;
			 }
		 } else if(s[i] == '1' && !flag) {
		 	flag = true;
		 	y0 ++ ;
		 	x0 = 0;
		 	x1 ++ ;
		 }
	 }
	 if(x0) y0 ++ ;
	 if(x1) y1 ++ ;
	 
	 if(y0 == 0 || y1 == 0) {
	 	if(n > k) cout << "Bob" << endl;
	 	else cout << "Alice" << endl;
	 } else if(y0 == 1 || y1 == 1) {
	 	cout << "Alice" << endl;
	 } else if(s == "0101" || s == "1010" || s == "1100" || s == "0110" || s == "0011" || s == "1001") {
	 	cout << "Bob" << endl;
	 } else {
	 	cout << ":(" << endl;
	 }
	
    return 0;
}