import sys
from collections import deque, Counter
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 63 - 1
mod = 998244353

n, k, t = mi()
k -= 1
c = input()

if 'A' not in c:
    print('Alice')
    exit()
if 'B' not in c:
    print('Bob')
    exit()
cnt = 0
l = r = k
for l in range(k - 1, -1, -1):
    if c[l] == c[k]:
        cnt += 1
    else:
        l += 1
        break
for r in range(k + 1, n):
    if c[r] == c[k]:
        cnt += 1
    else:
        r -= 1
        break
if r - k <= t and t % 2 == (r - k + 1) % 2:
    if r + 1 < n:
        print('Alice' if c[k] == 'A' else 'Bob')
        exit()

if k - l <= t and t % 2 == (l - k + 1) % 2:
    if l - 1 >= 0:
        print('Alice' if c[k] == 'A' else 'Bob')
        exit()

print('Bob' if c[k] == 'A' else 'Alice')