#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
bool solve(int n, int k, int t, string s) {
	if ('B' == s[k]) {
		rep(i, n) {
			if ('A' == s[i])s[i] = 'B';
			else s[i] = 'A';
		}
		return !solve(n, k, t, s);
	}
	if (((0 != k) && ('A' == s[k - 1])) || ((n - 1 != k) && ('A' == s[k + 1]))) {
		int l = -1, r = -1;
		rrep(i, k) {
			if ('B' == s[i]) {
				l = i;
				break;
			}
		}
		rep2(i, k + 1, n) {
			if ('B' == s[i]) {
				r = i;
				break;
			}
		}
		if ((-1 != l) && (k - l <= t) && ((k - l) % 2 == t % 2))return true;
		if ((-1 != r) && (r - k <= t) && ((r - k) % 2 == t % 2))return true;
		return false;
	}
	else {
		if (0 == t % 2)return false;
		if ((0 != k) && solve(n, k - 1, t - 1, s))return true;
		if (((n - 1) != k) && solve(n, k + 1, t - 1, s))return true;
		return false;
	}
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, k, t; cin >> n >> k >> t;
	string s; cin >> s;
	k--;
	cout << (solve(n, k, t, s) ? "Alice" : "Bob") << endl;
	return 0;
}