using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, k, t) = (c[0], c[1], c[2]);
        var s = ReadLine();
        WriteLine(Bomb(n, k, t, s) ? "Alice" : "Bob");
    }
    static bool Bomb(int n, int k, int t, string s)
    {
        --k;
        var rev = s[k] == 'B';
        var left = k;
        while (left >= 0 && s[left] == s[k]) --left;
        var right = k;
        while (right < n && s[right] == s[k]) ++right;
        var leftcanwin = left >= 0 && t - k + left >= 0 && (t - k + left) % 2 == 0;
        var rightcanwin = right < n && t - right + k >= 0 && (t - right + k) % 2 == 0;
        if (right - left > 2 && (leftcanwin || rightcanwin)) return true ^ rev;
        if (!leftcanwin && !rightcanwin) return false ^ rev;
        if (leftcanwin)
        {
            var lleft = left;
            while (lleft >= 0 && s[lleft] == s[left]) --lleft;
            if (lleft < 0 || (left - lleft) % 2 == 1) return true ^ rev;
        }
        if (rightcanwin)
        {
            var rright = right;
            while (rright < n && s[rright] == s[right]) ++rright;
            if (rright == n || (rright - right) % 2 == 1) return true ^ rev;
        }
        return false ^ rev;
    }
}