#
There is a Grasshopper in a tropical forest. The grasshopper can jump only vertically and

horizontally, and the length of the jump is always equal to x centimeters. A Grassshopper has found herself at the center of some cell of the chess board of

the size p×q centimeters (each cell is 1×1 centimeters).

She can jump as

she wishes for an arbitrary number of times, she can even visit a cell more

than once. The only restriction is that she cannot jump out of the board.The Grasshopper can count the amount of cells that she can reach from the

starting position (x,y). Let's denote this amount by d(x,y). Your task is to

find the number of such starting positions (x,y), which have the

maximum possible value of d(x,y)

Input

The integer array contains three integers p, q,x(1<=p,q,x<=10^6)

p = lenght of board

q = width of board

x = lenght of Grasshopper jump

1
by pradeepjmd

Log in to add a comment