Game

Problem Description

Alice and Bob are playing a game. There is a board of length $N$ and width $M$. They take turns placing a piece on an empty cell of the board. When a player places a piece, if for every $K \times K$ region of the board there is at least one piece, then the game ends and the player who placed the last piece wins. Alice moves first. Assuming both play optimally, determine who wins the game.

Input Format

The first line contains three positive integers $N$, $M$ and $K$ ($N \le M$).

Output Format

Output one line containing a string: if Alice wins (moving first), output Alice; otherwise output Bob.

Sample Input 1

1 2 1

Sample Output 1

Bob

Sample Input 2

3 3 2

Sample Output 2

Alice

Constraints

For all data: $1 \le N \le 3000$, $1 \le N \le M \le 10^5$, and $1 \le K \le N$.