The package for this problem was not updated by the problem writer or Codeforces administration after we've upgraded the judging servers. To adjust the time limit constraint, a solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then the value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

math

*1700

No tag edit access

The problem statement has recently been changed. View the changes.

×
C. Flea

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputIt 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}.

Input

The first line contains three integers *n*, *m*, *s* (1 ≤ *n*, *m*, *s* ≤ 10^{6}) — length of the board, width of the board and length of the flea's jump.

Output

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

Examples

Input

2 3 1000000

Output

6

Input

3 3 2

Output

4

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/25/2024 12:49:01 (l1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|