Type: RemoteJudge 1000ms 256MiB

Theatre Square

No submission language available for this problem.

You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

Description

Theatre Square in the capital city of Berland has a rectangular shape with the size n × m meters. On the occasion of the city's anniversary, a decision was taken to pave the Square with square granite flagstones. Each flagstone is of the size a × a.

What is the least number of flagstones needed to pave the Square? It's allowed to cover the surface larger than the Theatre Square, but the Square has to be covered. It's not allowed to break the flagstones. The sides of flagstones should be parallel to the sides of the Square.

The input contains three positive integer numbers in the first line: n,  m and a (1 ≤  n, m, a ≤ 109).

Write the needed number of flagstones.

Input

The input contains three positive integer numbers in the first line: n,  m and a (1 ≤  n, m, a ≤ 109).

Output

Write the needed number of flagstones.

Samples

6 6 4

4

SWPU-ACM 2022学年春训练计划第一周

Not Claimed
Status
Done
Problem
10
Open Since
2022-3-15 8:00
Deadline
2022-3-19 11:45
Extension
24 hour(s)