import sys
input = sys.stdin.readline
mod = 998244353

N, K, T = map(int, input().split())
C = input().rstrip('\n')

K -= 1
flg = 0
if C[K] == "B":
    C_new = []
    for c in C:
        if c == "A":
            C_new.append("B")
        else:
            C_new.append("A")
    C = "".join(C_new)
    flg = 1
C = C[max(0, K - T): min(N, K + T + 1)]
K = min(K, T)

exist_adj = 0
if K:
    if C[K - 1] == "A":
        exist_adj = 1
if K + 1 < len(C):
    if C[K + 1] == "A":
        exist_adj = 1

if not exist_adj:
    if K & 1 == (K - T) & 1:
        ans = 0
    else:
        if T == 1:
            ans = 1
        else:
            ans = 1
            # left
            if K - 2 >= 0:
                if C[K - 2] == "B":
                    for i in range(K - 3, -1, -1):
                        if C[i] == "A":
                            if i & 1 == (K - T) & 1:
                                ans = 0
                            break
            # right
            if K + 2 < len(C):
                if C[K + 2] == "B":
                    for i in range(K + 3, len(C)):
                        if C[i] == "A":
                            if i & 1 == (K - T) & 1:
                                ans = 0
                            break
else:
    assert 0
    ok = 0
    for i in range(K - 1, -1, -1):
        if C[i] == "B":
            if i & 1 == (K - T) & 1:
                ok = 1
            break
    for i in range(K + 1, len(C)):
        if C[i] == "B":
            if i & 1 == (K - T) & 1:
                ok = 1
            break
    if ok:
        ans = 1
    else:
        ans = 0

if flg:
    ans ^= 1
if ans:
    print("Alice")
else:
    print("Bob")