code forces 1A

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 ≤ 10⁹).

Output

Write the needed number of flagstones.

Examples

input

6 6 4

output

4

这个题第一次没A过，想着虽然a*a会越界，但是直接除了不会越界啊，然后仔细看题，确实存在越界问题，然后只需要分以下几种情况，其实可以合并，交给你们啦

#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
	long long n, m, a;
	long long sum = 0;
	cin >> n >> m >> a;
	if (n%a == 0 && m%a == 0)
	{
		sum = (n / a)*(m / a);
	}
	else if (n%a != 0 && m%a == 0)
	{
		sum = ((n / a) + 1)*(m / a);
	}
	else if (n%a == 0 && m%a != 0)
	{
		sum = (n / a)*((m / a)+1);
	}
	else if (n%a!= 0 && m%a != 0)
	{
		sum = (n / a)*(m / a)+(n/a)+(m/a)+1;
	}
	cout << sum << endl;
	return 0;
}