def solve(n, k, t, s):
	p1, p2 = k, k
	while p1 != -1 and s[p1] == s[k]:
		p1 -= 1
	while p2 != n and s[p2] == s[k]:
		p2 += 1
	q1, q2 = p1, p2
	while q1 != -1 and s[q1] != s[k]:
		q1 -= 1
	while q2 != n and s[q2] != s[k]:
		q2 += 1
	flag = False
	if p1 != -1 and (k - p1) % 2 == t % 2 and k - p1 <= t and (q1 == -1 or (p1 - q1) % 2 == 1 or k - q1 > t):
		flag = True
	if p2 != n and (p2 - k) % 2 == t % 2 and p2 - k <= t and (q2 == n or (q2 - p2) % 2 == 1 or q2 - k > t):
		flag = True
	return int(flag) ^ (1 if s[k] == 'A' else 0)

n, k, t = map(int, input().split())
s = input()
k -= 1
print('Alice' if solve(n, k, t, s) == 0 else 'Bob')