#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> PP;
// #define MOD 1000000007
#define MOD 998244353
#define INF 2305843009213693951
#define PI 3.141592653589
#define setdouble setprecision
#define REP(i,n) for(ll i=0;i<(n);++i)
#define OREP(i,n) for(ll i=1;i<=(n);++i)
#define RREP(i,n) for(ll i=(n)-1;i>=0;--i)
#define ORREP(i,n) for(ll i=(n);i>=1;--i)
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define chmin(k,m) k = min(k,m)
#define chmax(k,m) k = max(k,m)
#define GOODBYE do { cout << "-1" << endl; return 0; } while (false)
#define MM <<" "<<
#define Endl endl

map<pair<ll,ll>,ll> memo;
ll solve(ll A, ll B){

    if(memo.find({A,B})!=memo.end()){
        return memo[{A,B}];
    }

    ll win = 0;

    if(A==0){
        win = 1;
        memo[{A,B}] = win;
        return win;
    }
    if(B==0){
        win = 0;
        memo[{A,B}] = win;
        return win;
    }

    if(solve(B,A-1)==0){win=1;}
    if(A >= B && solve(B,A%B)==0){win=1;}

    memo[{A,B}] = win;
    return win;
}

int main(void){
    //cin.tie(nullptr);
    //ios::sync_with_stdio(false);

    ll A,B;
    cin >> A >> B;
    if(A==1 || (A>=B && B!=A-1)){
        cout << "Alice" << endl;
    }else{
        cout << "Bob" << endl;
    }
    // cout << (solve(A,B)==1?"Alice":"Bob") << endl;

    // OREP(a,100){
    //     OREP(b,100){
    //         bool s = solve(a,b);
    //         if(s==1)cout << a MM b MM (s?"win":"lose") << endl;
    //     }
    //     cout << endl;
    // }
    
    return 0;
    
}