import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } int solve(int k, int t, int x, int y) { if (x + y <= k) return y & 1; if (x >= y + k) return 0; if (y >= x + k) return k & 1; return ((x + y - k - 1) & 1) ^ t; } void main() { debug { enum lim = 11; foreach (k; 0 .. lim) { auto dp = new int[][][](2, lim, lim); foreach (x; 0 .. lim) foreach (y; 0 .. lim) foreach (t; 0 .. 2) { if (x + y <= k) { dp[t][x][y] = y & 1; } else { dp[t][x][y] = t ^ 1; if (x > 0 && dp[t ^ 1][x - 1][y] == t) dp[t][x][y] = t; if (y > 0 && dp[t ^ 1][x][y - 1] == t) dp[t][x][y] = t; } } writeln("k = ", k); foreach (t; 0 .. 2) { writeln(" t = ", t); foreach (x; 0 .. lim) { write(" "); foreach (y; 0 .. lim) { if (x + y < k) { write("-"); } else { write(dp[t][x][y]); } } writeln; } } stdout.flush; foreach (t; 0 .. 2) foreach (x; 0 .. lim) foreach (y; 0 .. lim) { const slv = solve(k, t, x, y); if (~slv) { assert(dp[t][x][y] == slv, format("k=%s t=%s x=%s y=%s: %s %s", k, t, x, y, dp[t][x][y], slv)); } assert(~slv); } } } try { for (; ; ) { const X = readInt; const Y = readInt; const K = readInt; const T = (readInt == -1) ? 1 : 0; const ans = solve(K, T, X, Y); writeln((ans == T) ? "Alice" : "Bob"); } } catch (EOFException e) { } }