New Town

In order to increase the population, Aizu Prefecture decided to build a new town. To do this, they decided to develop a new rectangular area of land and divide it into blocks of equal size squares. The cost of developing this land is proportional to the number of blocks, but the prefecture hopes to minimize this cost.

Given the length of the newly developed land in the east-west and north-south directions, and the development cost per block, make a program to calculate the minimum development cost when all the blocks are developed.

Input

The input is given in the following format.

W H C

In one line, the length of the newly developed land in the east-west direction W (1 ≤ W ≤ 1000) and north-south direction H (1 ≤ H ≤ 1000), and the development cost per block C (1 ≤ C ≤ 1000) are given as integers.

Output

Output the minimum cost required to develop the land in a line.

Sample Input 1

10 20 5

Sample Output 1

10

2 squares can be used to divide the land into blocks fully, and the development cost per block is 5, so the output is 10.

Sample Input 2

27 6 1

Sample Output 2

18

18 squares can be used to divide the land into blocks fully, and the development cost per block is 1, so the output is 18.

---