#include <bits/stdc++.h>
using namespace std;

#define ALL(x) (x).begin(),(x).end()
#define IO ios::sync_with_stdio(false),cin.tie(nullptr);
#define LB(v, x) (ll)(lower_bound(ALL(v),x)-(v).begin())
#define UQ(v) sort(ALL(v)),(v).erase(unique(ALL(v)),v.end())
#define REP(i, n) for(ll i=0; i<(ll)(n); i++)
#define FOR(i, a, b) for(ll i=(ll)(a); (a)<(b) ? i<(b) : i>(b); i+=((a)<(b) ? 1 : -1))
#define chmax(a, b) ((a)<(b) ? ((a)=(b), 1) : 0)
#define chmin(a, b) ((a)>(b) ? ((a)=(b), 1) : 0)

template<typename T> using rpriority_queue=priority_queue<T,vector<T>,greater<T>>;
using ll=long long; const int INF=1e9+10; const ll INFL=4e18; using ld=long double; using ull=uint64_t;
using VI=vector<int>; using VVI=vector<VI>; using VL=vector<ll>; using VVL=vector<VL>;
using PL=pair<ll,ll>; using VP=vector<PL>; using WG=vector<vector<pair<int,ll>>>;



bool dfs(ll a, ll b, bool turn){
    if(a==0) return turn;
    if(b==0) return !turn;

    if(b<=a)if(dfs(b,a%b,!turn)==turn) return turn;
    if(dfs(b,a-1,!turn)==turn) return turn;

    return !turn;
}

void jikken(){
    FOR(i,1,100) cerr<<i<<' '<<80<<' '<<(dfs(i,80,1)?"Alice":"Bob")<<endl;
}

int main(){
    jikken();
    ll A,B; cin>>A>>B;

    if(A==1) puts("Alice");
    else if(A%B==0) puts("Alice");
    else if(B<A-1) puts("Alice");
    else if(B==A-1) puts("Bob");
    else if(A==B) puts("Alice");
    else if(A<B) puts("Bob");
}