Taco Grid Game Winner

You are given a grid with m rows and n columns. In a game played on this grid, each move increments the value in one cell by 1. A cell is considered complete when its value reaches the target number k.

Alex starts first and both players play optimally. It turns out that the only factor affecting the final outcome is the parity of k. In particular, if $$k \bmod 2 = 1$$ (i.e., k is odd), then Alex wins as he will perform the final necessary increment. Otherwise, if k is even, Bob wins.

Your task is to determine the winner given the integers m, n, and k.

inputFormat

The input consists of a single line containing three space-separated integers: m (number of rows), n (number of columns), and k (target value for each cell).

outputFormat

Output a single line containing the name of the winner: either Alex or Bob.

2 3 3

Alex