#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

bool solve(string s, int k, int t){
    assert(s[k] == 'A');
    k += s.size()-1;
    {
        auto s_rev = s;
        reverse(s_rev.begin(), s_rev.end());
        s_rev.pop_back();
        auto t = s_rev+s;
        s_rev = s;
        s_rev.pop_back();
        reverse(s_rev.begin(), s_rev.end());
        t += s_rev;
        s = t;
    }
    // debug_value(s)
    int n = s.size();
    int l = k, r = k;
    for(int i = k-1; i >= 0; i--){
        if(s[i] == 'A'){
            l--;
        }else{
            break;
        }
    }
    for(int i = k+1; i < n; i++){
        if(s[i] == 'A'){
            r++;
        }else{
            break;
        }
    }
    // cout << l << ' ' << r << endl;
    if(l == 0 && r == n-1){
        return false;
    }
    int left_len = 0, right_len = 0;
    for(int i = l-1; i >= 0; i--){
        if(s[i] == 'A') break;
        left_len++;
    }
    for(int i = r+1; i < n; i++){
        if(s[i] == 'A') break;
        right_len++;
    }
    int len = r-l+1;
    if(len == 1){
        // 負けのタイミングで出る場合
        if(t%2 == 0) return false;
        // 勝ちのタイミングで出られる
        if(left_len%2 == 1 || right_len%2 == 1) return true;
        // 左右のどちらも偶数長
        int rem = t-1;
        if(left_len > rem || right_len > rem) return true;
        return false;
    }
    // 余計な回数を稼げる 
    int a = k-(l-1);
    int b = (r+1)-k;
    if(a <= t && (a%2 == t%2)) return true;
    if(b <= t && (b%2 == t%2)) return true;
    return false;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n, k, t; cin >> n >> k >> t; k--;
    string s; cin >> s;
    bool flipped = false;
    if(s[k] == 'B'){
        flipped = true;
        for(int i = 0; i < n; i++){
            if(s[i] == 'A') s[i] = 'B';
            else s[i] = 'A';
        }
    }
    bool f = solve(s, k, t);
    if(flipped) f = !f;
    if(f) cout << "Alice" << endl;
    else cout << "Bob" << endl;
}