#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")

#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int main(){
    ll n,k,t;cin >> n >> k >> t;
    k--;
    string s;cin >> s;
    auto dfs=[](auto &self,string s,ll k,ll n,ll t) -> ll {
        bool flag=false;
        if(s[k]=='B'){
            flag=true;
            rep(i,n){
                if(s[i]=='B')s[i]='A';
                else s[i]='B';
            }
        }
        ll left=INF,right=-INF;
        for(ll j=k;j>=0;j--){
            if(s[j]=='A')chmin(left,j);
            else break;
        }
        for(ll j=k;j<n;j++){
            if(s[j]=='A')chmax(right,j);
            else break;
        }
        if(left!=right){
            ll ans=0;
            if(left!=0){
                ll p=t;
                if(p>k-left){
                    p-=(k-left);
                    if(p%2)ans=1;
                }
            }
            if(right!=n-1){
                ll p=t;
                if(p>right-k){
                    p-=right-k;
                    if(p%2)ans=1;
                }
            }
            return flag^ans;
        }
        else{
            if(t%2==0){
                return flag;
            }
            else{
                ll ans=0;
                if(k-1>=0){
                    ll f=self(self,s,k-1,n,t-1);
                    if(f==1)ans=1;
                }
                if(k+1<n){
                    ll f=self(self,s,k+1,n,t-1);
                    if(f==1)ans=1;
                }
                return ans^flag;
            }
        }
    };
    cout << (dfs(dfs,s,k,n,t)? "Alice":"Bob") << endl;
}