n, k, t = map(int, input().split()) c = input().strip() k -= 1 # Convert to 0-based index min_steps = float('inf') # Find the minimal distance to any 'B' from position k for i in range(n): if c[i] == 'B': distance = abs(i - k) if distance < min_steps: min_steps = distance if min_steps > t: print("Bob") else: rem = t - min_steps if rem % 2 == 0: print("Alice") else: print("Bob")