There is a room size $n \times m$. Find the maximum number of tiles of size $k \times k$ that can be placed in the room. \includegraphics{https://static.eolymp.com/content/2h/2h77gg8top2vva61cfmh7rh6hk.gif} The figure shows one of the possible maximum answers for $n = 5, m = 3, k = 2$. \InputFile The first line contains an integer $n~(1 \le n \le 1000)$. The second line contains an integer $m~(1 \le m \le 1000)$. The third line contains an integer $k~(1 \le k \le 1000)$. \OutputFile Print the maximum number of whole tiles of size $k \times k$ that can be placed in the room.