#ifdef LOCAL
#include <local.hpp>
#else
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2")
#include <bits/stdc++.h>
#define debug(...) ((void)0)
#define postprocess(...) ((void)0)
#endif

using namespace std;
using ll = long long;
using ld = long double;

void solve([[maybe_unused]] int test) {
    int N, K, T;
    cin >> N >> K >> T;

    K--;

    char c[N];
    for (int i = 0; i < N; i++) {
        cin >> c[i];
    }

    bool A[N];
    for (int i = 0; i < N; i++) {
        A[i] = c[i] == 'A';
    }

    int l = K;
    while (0 < l && A[l - 1] == A[l]) l--;

    int r = K;
    while (r < N - 1 && A[r + 1] == A[r]) r++;

    bool win = false;

    if (l != 0) {
        int t = T - abs(K - l);
        if (t > 0 && t % 2 == 1) win = true;
    }

    if (r != N - 1) {
        int t = T - abs(K - r);
        if (t > 0 && t % 2 == 1) win = true;
    }

    cout << (win ? (A[K] ? "Alice" : "Bob") : (A[K] ? "Bob" : "Alice")) << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    for (int i = 1; i <= t; i++) {
        solve(i);
    }

    postprocess();
}