#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
using namespace std;
using ll = long long;
constexpr int INF = 1e9;
constexpr ll LINF = 1e18;
string YesNo(bool cond) {
    return cond ? "Yes" : "No";
}
string YESNO(bool cond) {
    return cond ? "YES" : "NO";
}
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
bool chmin(T& a, const T& b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template <typename T, class F>
T bisect(T ok, T ng, const F& f) {
    while (abs(ok - ng) > 1) {
        T mid = min(ok, ng) + (abs(ok - ng) >> 1);
        (f(mid) ? ok : ng) = mid;
    }
    return ok;
}
template <typename T, class F>
T bisect_double(T ok, T ng, const F& f, int iter = 100) {
    while (iter--) {
        T mid = (ok + ng) / 2;
        (f(mid) ? ok : ng) = mid;
    }
    return ok;
}
template <class T>
vector<T> make_vec(size_t a) {
    return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
    return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <typename T>
istream& operator>>(istream& is, vector<T>& v) {
    for (int i = 0; i < int(v.size()); i++) {
        is >> v[i];
    }
    return is;
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < int(v.size()); i++) {
        os << v[i];
        if (i < sz(v) - 1) os << ' ';
    }
    return os;
}
int main() {
    int n, k, t;
    string s;
    cin >> n >> k >> t >> s;
    k--;
    int l = k, r = k;
    while (l > 0 && s[l - 1] == s[l]) l--;
    while (r + 1 < n && s[r] == s[r + 1]) r++;

    bool ans = [&] {
        if ((l == 0 || k - l + 1 > t) && (r == n - 1 || r - k + 1 > t)) {
            return false;
        }
        if (t % 2 == 1) {
            if (l != 0 && (k - l + 1) % 2 != 0) return true;
            if (r != n - 1 && (r - k + 1) % 2 != 0) return true;
            return false;
        } else {
            if (l != 0 && (k - l + 1) % 2 == 0) return true;
            if (r != n - 1 && (r - k + 1) % 2 == 0) return true;
            return false;
        }
        return false;
    }();

    ans ^= s[k] == 'B';
    if (ans) {
        cout << "Alice\n";
    } else {
        cout << "Bob\n";
    }
}