n, k, t = map(int, input().split())
c = input().strip()
current_char = c[k-1]

required_char = 'B' if current_char == 'A' else 'A'
found = False

for i in range(n):
    if c[i] == required_char:
        distance = abs((i + 1) - k)
        if distance <= t and (t - distance) % 2 == 0:
            found = True
            break

if found:
    print('Alice' if current_char == 'A' else 'Bob')
else:
    print('Bob' if current_char == 'A' else 'Alice')