#include <stdio.h>

int func (int n, int k, int t, char *c) {
  int is_win = 0;
  int idx[2] = {};
  
  idx[0] = k-1;
  while (idx[0] >= 0 && c[idx[0]] == c[k]) {
    idx[0]--;
  }
  if (idx[0] < 0) {
    idx[0] = -1000000001;
  }
  
  idx[1] = k+1;
  while (idx[1] < n && c[idx[1]] == c[k]) {
    idx[1]++;
  }
  if (idx[0] >= n) {
    idx[0] = 1000000001+n;
  }
  
  if (k-idx[0] > t && idx[1]-k > t) {
    is_win = -1;
  } else if ((k-idx[0] > t || (k-idx[0])%2 != t%2) && (idx[1]-k > t || (idx[1]-k)%2 != t%2)) {
    is_win = -1;
  } else if ((idx[0] < 0 && idx[1] > 1) || (idx[1] >= n && idx[0] < n-2) || (idx[0] >= 0 && idx[1] < n && idx[1]-idx[0] > 2)) {
    is_win = 1;
  } else if (k == n-2 || k == 1 || (k != 0 && c[k-2] == c[k]) || (k != n-1 && c[k+2] != c[k])) {
    is_win = 1;
  } else {
    int is_ng = 1;
    is_win = 1;
    if (k < n-1 && func(n, k+1, t-1, c) < 0) {
      is_ng = 0;
    }
    if (k > 0 && func(n, k-1, t-1, c) < 0) {
      is_ng = 0;
    }
    is_win *= (1-2*is_ng);
  }
  
  return is_win;
}

int main () {
  int n = 0;
  int k = 0;
  int t = 0;
  char c[200001] = "";
  
  int res = 0;
  
  int is_win = 0;
  
  res = scanf("%d", &n);
  res = scanf("%d", &k);
  res = scanf("%d", &t);
  res = scanf("%s", c);
  k--;
  
  is_win = func(n, k, t, c);
  
  if ((is_win > 0 && c[k] == 'A') || (is_win < 0 && c[k] == 'B')) {
    printf("Alice\n");
  } else {
    printf("Bob\n");
  }
  
  return 0;
}