Bob and Alice have three piles of apples. There are M, N and N apples in each pile, respectively.

Clever Alice and idle Bob play the game. Alice and Bob take turns to take the apples from the game. The rules are as follows:

1. Choose a pile and take no more than S apples from it;
2. Or you can take the same number(can be larger than S) of apples from three piles at a time. If there is a pile with no apples, the rule cannot be used to take apples.

When the game starts, Alice takes the apple first. And they both take the optimal strategy.

The one who gets the last apple will win.

For given M,N,S, who will win, Alice or Bob?

The input contains multiple sets of data

For each test case, each line contains three integersS,M,N, separated by spaces.

For each test case, outputs a single line with the answer.

If Alice wins, output "Alice"; If Bob wins, output "Bob" (without quotes).

1 5 3
4 4 3

Alice
Alice