A. Theatre Square

               

A. Theatre Square

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

Copy

6 6 4

output

Copy

4

题目看了一眼大概是给了一个指定矩形，然后给一个size为a的正方形，用正方形来填充这个矩阵，求最小使用的数量。直接用正方形的边除a的size，取天花板函数就行了。最后返回乘积就行了。保存结果用long long，亲测会爆int。

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<string>
#include<cstring>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<utility>
#include<cmath>
#include<climits>
#include<deque>
#define max(a,b) (a>b?a:b)
#define min(a,b) (a<b?a:b)
#define INF 0x7f7f7f7f
#define maxn 100000
#define eps 1e-15
#define MOD ((int)(1e9+7))
using namespace std;
inline long long fast_read() {
	char c;
	long long ret = 0, sgn = 1;
	do { c = getchar(); } while ((c < '0' || c > '9') && c != '-');
	if (c == '-') sgn = -1; else ret = c - '0';
	while ((c = getchar()) >= '0' && c <= '9') ret = ret * 10 + (c - '0');
	return sgn * ret;

}
int main(void)
{
	cin.tie(0);
	ios::sync_with_stdio(false);
	long long n, m, a, w, h;
	n = fast_read(); m = fast_read(); a = fast_read();
	if (n%a == 0)w = n / a;
	else w = n / a + 1;
	if (m%a == 0)h = m / a;
	else h = m / a + 1;
	cout << w*h << endl;
	//system("pause");
	return 0;
}