Maximizing Coin Placement in a Drawer

You are given a rectangular drawer with a length of L and a width of W, along with coins of diameter D. Your task is to determine the maximum number of coins that can be arranged within the drawer without overlapping. The coins must be placed in a grid-like pattern such that they are aligned in rows and columns.

The number of coins that can fit along the length is given by the formula:

$\left\lfloor \frac{L}{D} \right\rfloor$

Similarly, along the width, the number is:

$\left\lfloor \frac{W}{D} \right\rfloor$

Thus, the total number of coins that can be placed is:

$\left\lfloor \frac{L}{D} \right\rfloor \times \left\lfloor \frac{W}{D} \right\rfloor$

Write a program to compute this value.

inputFormat

The input is read from stdin and contains three space-separated floating-point numbers: L, W, and D, which represent the length and width of the drawer and the diameter of a coin, respectively.

outputFormat

Output a single integer to stdout; this integer is the maximum number of coins that can be placed within the drawer without overlapping.

## sample

5.0 3.0 1.0

15