Chocolate#2658
Two players play a game with a chocolate bar of size N \times M. The players take turns. On each turn, a player may break any existing piece of chocolate into 2 "non-empty" pieces. It is forbidden to break a piece that does not exceed 1 \times S in size (i.e., you cannot break a piece that has one side of length and the other side at most ). Pieces may be rotated. Of course, a piece may only be broken along the lines present on the chocolate bar, so after a break, there must be two rectangles with integer, nonzero side lengths.
The player who cannot make a move loses.
The input file contains three integers , , and (0 < N, M, S \leq 100).
Output a single number or — the number of the player who will win with correct play.
Example 1