Room#505

Room

1 секунда
256 мегабайт
Very easy

Given a room of size n \times m. Find the maximum number of whole tiles of size k \times k that can fit in the room?

The picture shows one of the possible maximum answers for n=5, m=3, k=2.

Input

The first line contains an integer (1 \leq n \leq 1\,000).

The second line contains an integer (1 \leq m \leq 1\,000).

The third line contains an integer (1 \leq k \leq 1\,000).

Output

Output a single integer — the answer to the problem.

Examples

Example 1

Loading
Loading