n, k, t = map(int, input().split())
s = input()
k -= 1

def first_win(s, k, t):
    l = r = k
    while l > 0 and s[l - 1] == s[k]:
        l -= 1
    while r + 1 < n and s[r + 1] == s[k]:
        r += 1
    if r - l + 1 > 1:
        if l > 0:
            d = k - (l - 1)
            if d <= t and (t - d) % 2 == 0:
                return True
        if r + 1 < n:
            d = r + 1 - k
            if d <= t and (t - d) % 2 == 0:
                return True
        return False
    else:
        ok = False
        side_min = n + 10
        if k > 0:
            l = k - 1
            while l > 0 and s[l - 1] != s[k]:
                l -= 1
            side_min = min(side_min, k - l)
        if k + 1 < n:
            r = k + 1
            while r + 1 < n and s[r + 1] != s[k]:
                r += 1
            side_min = min(side_min, r - k)
        if side_min == 1:
            return t % 2 == 1
        else:
            return (k > 0 and not first_win(s, k - 1, t - 1)) or (k + 1 < n and not first_win(s, k + 1, t - 1))

ans = first_win(s, k, t)
if s[k] == 'B':
    ans = not ans
print('Alice' if ans else 'Bob')