n, k, t = map(int, input().split())
c = input().strip()
k -= 1  # Convert to 0-based index

current_char = c[k]

# Find minimal steps to reach a cell of opposite type
min_left = float('inf')
steps = 0
pos = k
while pos >= 0 and c[pos] == current_char:
    pos -= 1
    steps += 1
if pos >= 0 and c[pos] != current_char:
    min_left = steps

min_right = float('inf')
steps = 0
pos = k
while pos < n and c[pos] == current_char:
    pos += 1
    steps += 1
if pos < n and c[pos] != current_char:
    min_right = steps

min_steps = min(min_left, min_right)

if min_steps <= t and (t - min_steps) % 2 == 0:
    print("Alice" if current_char == 'A' else "Bob")
else:
    print("Bob" if current_char == 'A' else "Alice")