https://acs.jxnu.edu.cn/external/gym/doc/GYM100001A.doc
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.
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.
Sample test(s)
input
6 6 4
output
4
中文翻译:
首都柏林的剧院中心是m*n的长方形。在这个城市的周年纪念日上,决定用方形花岗石铺设广场。每一块石板的大小都是a*a。
最少需要多少石板铺设广场,允许覆盖比剧院广场大的表面,但广场必须被覆盖。不可以打破花岗石,石板的侧面应与广场的侧面平行。
输入:
第一行包含三个正整数:n,m,和a(1 ≤ n, m, a ≤ 109)
输出:
输出所需石板的数量
样本测试:
输入:
6 6 4
输出
4