#include <cstdio>
#include <algorithm>
using namespace std;

typedef long long LL;

const int N = 1000005;

int n, a, b, c[N], f[N];
LL s[N];

int main() {
	while(3==scanf("%d%d%d", &n, &a, &b)) {
		for(int i = 0; i < n; ++i) {
			scanf("%d", c+i);
		}
		s[n] = 0;
		for(int i = n-1; i >= 0; --i) {
			s[i] = s[i+1] + c[i];
		}
		LL D = 1LL+a+b-s[0], m = 0;
		for(int i = n-1; i >= 0; --i) {
			f[i] = s[i] + m;
			m = min(m, max(-s[i], D-f[i]));
		}
		puts(a >= f[0] ? "ALICE" : "BOB");
	}
}