#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <atcoder/modint>
using namespace std;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
const i64 INF = 1001001001001001001;

using Modint = atcoder::static_modint<998244353>;

int solve(int N, int K, int T, string C){
    if(C[K] == 'B'){
        for(char c : C) c ^= 'A' ^ 'B';
        return solve(N, K, T, std::move(C)) ^ 1;
    }
    if(T % 2 == 1){
        int q = 1;
        if(K != 0 && solve(N, K-1, T-1, C) == 0) q = 0;
        if(K != N-1 && solve(N, K+1, T-1, C) == 0) q = 0;
        return q;
    }
    
    int lB = -1;
    for(int i=K; i>=0; i--) if(C[i] == 'B'){ lB = i; break; }
    int rB = -1;
    for(int i=K; i<N; i++) if(C[i] == 'B'){ rB = i; break; }

    if(lB != -1 && lB % 2 == K % 2 && K-lB <= T) return 0;
    if(rB != -1 && rB % 2 == K % 2 && rB-K <= T) return 0;
    return 1;
}

int main(){
    int N, K, T; cin >> N >> K >> T;
    string C; cin >> C;
    K--;
    
    cout << (solve(N, K, T, C) ? "Bob" : "Alice") << endl;
    
    return 0;
}



struct ios_do_not_sync{
    ios_do_not_sync(){
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} ios_do_not_sync_instance;