time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Examples

input

6 6 4

output

4 #include <iostream> #include <stdio.h> using namespace std; int n,m,a; int main() {scanf("%d%d%d",&n,&m,&a);long long x=1,y=1;x=n/a;if(n%a)x++;y=m/a;if(m%a)y++;cout<<x*y<<endl;//cout << "Hello world!" << endl;return 0; }

?

與50位技術專家面對面20年技術見證，附贈技術全景圖

總結

以上是生活随笔為你收集整理的Theatre Square的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。