#pragma GCC target("avx") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include using namespace std; #define rep(i,n) for(int i = 0; i < (int)n; i++) #define FOR(n) for(int i = 0; i < (int)n; i++) #define repi(i,a,b) for(int i = (int)a; i < (int)b; i++) #define pb push_back #define all(x) x.begin(),x.end() //#define mp make_pair #define vi vector #define vvi vector #define vll vector #define vvll vector #define vs vector #define vvs vector #define vc vector #define vvc vector #define pii pair #define pllll pair #define vpii vector> #define vpllll vector> #define vpis vector> #define vplls vector> #define vpsi vector> #define vpsll vector> template void chmax(T &a, const T &b) {a = (a > b? a : b);} template void chmin(T &a, const T &b) {a = (a < b? a : b);} using ll = long long; using ld = long double; using ull = unsigned long long; const ll INF = numeric_limits::max() / 2; const ld pi = 3.1415926535897932384626433832795028; const ll mod = 998244353; int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1}; int dy[] = {0, -1, 0, 1, -1, 1, -1, 1}; #define int long long void solve() { int x, y, k, p; cin >> x >> y >> k >> p; int turn = x + y - k; if(turn%2==1) { if(p == 1) { if(turn / 2 >= x && (y - (turn - x))%2==0) { cout << "Bob" << endl; }else { cout << "Alice" << endl; } }else { if(turn / 2 >= y) { cout << "Bob" << endl; }else { cout << "Alice" << endl; } } }else { if(p == 1) { if(turn / 2 >= y) { cout << "Alice" << endl; }else { cout << "Bob" << endl; } }else { if(turn / 2 >= x && (y - (turn - x))%2==1) { cout << "Alice" << endl; }else { cout << "Bob" << endl; } } } } signed main() { cin.tie(nullptr); ios::sync_with_stdio(false); solve(); return 0; }