CF32C.Flea

It is known that fleas in Berland can jump only vertically and horizontally, and the length of the jump is always equal to s centimeters. A flea has found herself at the center of some cell of the checked board of the size n × m 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 flea 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.

已知伯兰的跳蚤只能垂直或水平跳跃，且每次跳跃的长度恒为 $s$ 厘米。一只跳蚤发现自己位于一块 $n \times m$ 厘米的方格棋盘（每个格子为 $1 \times 1$ 厘米）中某个格子的中心。她可以任意次数地跳跃，甚至可以多次访问同一格子。唯一的限制是她不能跳出棋盘边界。

跳蚤能够计算出从起始位置 $(x, y)$ 出发所能到达的格子总数，记该数为 $d_{x,y}$。你的任务是：找出所有使得 $d_{x,y}$ 取得最大可能值的起始位置 $(x, y)$ 的个数。

The first line contains three integers n, m, s (1 ≤ n, m, s ≤ 106) — length of the board, width of the board and length of the flea's jump.

第一行包含三个整数 $n$、$m$、$s$（$1 ≤ n, m, s ≤ 10^6$）—— 分别表示棋盘的长度、宽度以及跳蚤的跳跃长度。

Output the only integer — the number of the required starting positions of the flea.

输出唯一的整数——跳蚤所需起始位置的数量。