【标题】1.17 Theatre Square

描述： 

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.

样例输入：

6 6 4

样例输出：

4

翻译：

描述：

在伯兰德的首都有一个矩形的剧院广场，是n*m米的。在城市的周年庆典上，准备用方形的花岗岩石板铺平广场。每一个石板是a*a米的。

至少需要多少块石板才能铺完这个广场？可以允许铺的面积比剧院广场大，但是广场必须被铺满。不允许打破石板。石板的边缘必须与广场的边缘平行。

输入：

第一行的输入包括3个正整数：n，m和a (1 ≤  n, m, a ≤ 109)。

输出：

输出所需石板数。

样例输入：

6 6 4

样例输出：

4