#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (int)1e18
#define f first
#define s second

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());
bool g[2];

void Solve() 
{
    int n, k, t; cin >> n >> k >> t;
    k--;
    
    string s; cin >> s;
    
    int l = k, r = k;
    while (l >= 0 && s[l] == s[k]) l--;
    while (r < n && s[r] == s[k]) r++;
    
    if (l >= 0 && l >= k - t) g[l & 1] = true;
    if (r < n && r <= k + t) g[r & 1] = true;
    
    bool win = g[(t + k) & 1];
    //assert(r - l > 2);
    if (s[k] == 'A') {
        if (win) cout << "Alice\n";
        else cout << "Bob\n";
    }
    else {
        if (win) cout << "Bob\n";
        else cout << "Alice\n";
    }
}

int32_t main() 
{
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
 //   cin >> t;
    for(int i = 1; i <= t; i++) 
    {
        //cout << "Case #" << i << ": ";
        Solve();
    }
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
   // cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
    return 0;
}