#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
template<class T> bool chmax(T &a, T b){if (a < b){a = b;return true;} else return false;}
template<class T> bool chmin(T &a, T b){if (a > b){a = b;return true;} else return false;}

bool F(char c,bool flag,int n,int k,int t,string&s){
    int l=k,r=k;
    while(l>=0&&s[l]==c)l--;
    l++;
    while(r<n&&s[r]==c)r++;
    r--;
    if(l==r){
        if(t%2==0)return false;
        else{
            if(flag){
                bool f=false;
                if(k-1>=0)f=f||!F(char('A'+'B'-c),!flag,n,k-1,t-1,s);
                if(k+1<n)f=f||!F(char('A'+'B'-c),!flag,n,k+1,t-1,s);
                return f;
            }
            else{
                return false;
            }
        }
    }else{
        if(min(k-l,r-k)>=t)return false;
        else if((t%2==1&&((l!=0&&k%2==l%2)||(r!=n-1&&k%2==r%2)))||(t%2==0&&((l!=0&&k%2!=l%2)||(r!=n-1&&k%2!=r%2))))return true;
        else return false;
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n,k,t;
    cin>>n>>k>>t;
    k--;
    string s;
    cin>>s;
    if(F(s[k],true,n,k,t,s)){
        if(s[k]=='A')cout<<"Alice"<<"\n";
        else cout<<"Bob"<<"\n";
    }else{
        if(s[k]=='B')cout<<"Alice"<<"\n";
        else cout<<"Bob"<<"\n";
    }
}