CF Theatre Square

Theatre Square

time limit per test

2 seconds

memory limit per test

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

Output

Write the needed number of flagstones.

Sample test(s)

Input

6 6 4

Output

4


易知，n/a即为需要多少块a，每一块a都能完全用完,又知，n%a若不零，那么还需要再添加一块，若为零则不需要。
所以总的块数即为(n / a + (n % a) ? 1 : )) * (m / a + (m % a) ? 1 : 0)

#include <iostream>
#include <cstdio>
using    namespace    std;

int    main(void)
{
    long    long    n,m,a;
    long    long    ans;

    scanf("%lld%lld%lld",&n,&m,&a);
    ans = (n / a + ((n % a) ? 1 : 0)) * (m / a + ((m % a) ? 1 : 0));
    printf("%lld
",ans);

    return    0;
}