#define _USE_MATH_DEFINES
#include <cmath>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;

bool nimK(const vector<int> &v, int k) {
    for (int b = 0; b < 30; ++b) {
        int cnt = 0;
        for (int i = 0; i < (int)v.size(); ++i) {
            if (v[i] >> b & 1) cnt++;
        }
        if (cnt % (k + 1) != 0) return true;
    }
    return false;
}

int main() {
    int n, m, l, r;
    while (cin >> n >> m >> l >> r) {
        vector<int> s(n);
        rep(i, n) cin >> s[i];

        int k = (int)floor(l / (2.0 * M_PI * r));

        vector<int> a(n);
        rep(i, n) a[i] = (int)ceil(s[i] / (2.0 * M_PI * r));

        vector<int> b(n);
        rep(i, n) b[i] = a[i] % (k + 1);

        if (nimK(b, m)) {
            cout << "Alice" << endl;
        } else {
            cout << "Bob" << endl;
        }
    }
}

#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) begin(v), end(v)
using namespace std;

int main() {
    int r = 3;

    map<vector<int>, bool> mp;

    auto analysis = [&](auto f, vector<int> a) -> bool {
        int n = a.size();
        sort(all(a));
        if (mp.contains(a)) return mp[a];
        if (all_of(all(a), [](int x) { return x == 0; })) return false;

        rep(i, n) reps(ic, min(r, a[i])) {  // 2つの山を選ぶ場合
            rep2(j, i + 1, n) reps(jc, min(r, a[j])) {
                auto b = a;
                b[i] -= ic;
                b[j] -= jc;
                if (!f(f, b)) {
                    return mp[a] = true;
                }
            }
        }
        rep(i, n) reps(ic, min(r, a[i])) {  // 1つの山を選ぶ場合
            auto b = a;
            b[i] -= ic;
            if (!f(f, b)) {
                return mp[a] = true;
            }
        }
        return mp[a] = false;
    };

    vector<int> vec;
    auto rec = [&](auto rec, int len) {  // len要素、0~9からなる広義単調増加列を列挙する
        if (vec.size() == len) {
            int ret = analysis(analysis, vec);
            rep(i, vec.size()) cout << vec[i];
            cout << " : " << ret << endl;
            return;
        }
        rep(i, 10) {
            if (vec.size() && vec.back() > i) continue;
            vec.push_back(i);
            rec(rec, len);
            vec.pop_back();
        }
    };
    rec(rec, 3);
    rec(rec, 4);
    return 0;
}