#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=998244353;
#define rep(i,a,b) for (ll i=a;i<b;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}



void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,0,t) solve();
}

void solve(){
	int N,K,T;
	cin>>N>>K>>T;
	vector<char> p(N+4,'c');
	rep(i,0,N) cin>>p[i+2];
	K+=1;
	auto rev=[&]()->void{
		for(auto &x:p){
			if(x=='A') x='B';
			else if(x=='B') x='A';
		}
		return;
	};
	bool Al=0;
	bool S=0;
	if(p[K]=='B'){
		rev();
		S=1;
	}
	auto f=[&](int ind,int t)->bool{
		if(t==0) return 0;
		int l=ind,r=ind;
		while(p[l]==p[ind]) l--;
		while(p[r]==p[ind]) r++;
		if(l==r) return 0;
		if(p[l]<='C'&&ind-l<=t&&(ind-l-t)%2==0) return 1;
		if(p[r]<='C'&&r-ind<=t&&(r-ind-t)%2==0) return 1;
		return 0;
	};
	if(T%2==0){
		if(f(K,T)) Al=1;
	}
	else{
		if(f(K,T)) Al=1;
		if(p[K-1]=='B'&&!f(K-1,T-1)) Al=1;
		if(p[K+1]=='B'&&!f(K+1,T-1)) Al=1;
	}
	//yneos(Al);
	//yneos(S);
	cout<<((Al^S)?"Alice\n":"Bob\n");
}