#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

typedef long long ll;

void solve() {
    ll N, K;
    if (!(cin >> N >> K)) return;

    if (N == 1 || K < 2) {
        cout << "Bob" << endl;
        return;
    }

    ll divisor_count = 0;
    for (ll d = 1; d * d <= N; ++d) {
        if (N % d == 0) {
            // Ước nhỏ d
            if (d >= 2 && d <= K) {
                divisor_count++;
            }
            // Ước lớn N/d
            ll other = N / d;
            if (other != d) {
                if (other >= 2 && other <= K) {
                    divisor_count++;
                }
            }
        }
    }

    if (divisor_count % 2 != 0) {
        cout << "Alice" << endl;
    } else {
        cout << "Bob" << endl;
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}