N, K, T = map(int, input().split())
S = input()

K -= 1

def win(K, T) :
    if T == 0 :
        return False
    oth = chr(ord(S[K]) ^ 3)
    l = S[:K].rfind(oth)
    r = S.find(oth, K)
    if r == -1 :
        r = N
    if r - l > 2 :
        if l != -1 and (K - l - T) % 2 == 0 and K - l <= T :
            return True
        if r != N and (r - K - T) % 2 == 0 and r - K <= T :
            return True
        return False
    if T % 2 == 0 :
        return False
    return (l != -1 and not win(K-1, T-1)) or (r != N and not win(K+1,T-1))

if win(K, T) :
    res = S[K]
else :
    res = chr(ord(S[K]) ^ 3)
if res == 'A' :
    print('Alice')
else :
    print('Bob')