import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int N;
string S;

int[] ls, rs, ws;

char solve(int k, int t) {
  const win = S[k];
  const lose = S[k] ^ 'A' ^ 'B';
  char ret = '?';
  if (t == 0) {
    ret = win;
  } else {
    if (ws[k] == 1) {
      if (t % 2 != 0) {
        if (k - 1 >= 0 && ws[k - 1] == 1) {
          ret = win;
        } else if (k + 1 < N && ws[k + 1] == 1) {
          ret = win;
        } else {
          if (k - 1 >= 0 && solve(k - 1, t - 1) == S[k]) {
            ret = win;
          } else if (k + 1 < N && solve(k + 1, t - 1) == S[k]) {
            ret = win;
          } else {
            ret = lose;
          }
        }
      } else {
        ret = lose;
      }
    } else {
      bool check(int kk) {
        return (0 <= kk && kk < N && abs(kk - k) <= t && ((kk - k) & 1) == (t & 1));
      }
      if (check(ls[k] - 1)) {
        ret = win;
      } else if (check(rs[k])) {
        ret = win;
      } else {
        ret = lose;
      }
    }
  }
  debug {
    writefln("solve %s %s = %s", k, t, ret);
  }
  return ret;
}

void main() {
  try {
    for (; ; ) {
      N = readInt;
      const K = readInt - 1;
      const T = readInt;
      S = readToken;
      
      ls = new int[N];
      rs = new int[N];
      ws = new int[N];
      for (int i = 0, j; i < N; i = j) {
        for (j = i; j < N && S[i] == S[j]; ++j) {}
        ls[i .. j] = i;
        rs[i .. j] = j;
        ws[i .. j] = j - i;
      }
      
      const ans = solve(K, T);
      writeln((ans == 'A') ? "Alice" : "Bob");
    }
  } catch (EOFException e) {
  }
}