AIUB Computer Club is doing a great job organizing this contest. They have been working hard to set up a nice environment for participants. Alongside of food, prizes contestants will also get colorful balloons for solving problems, cool right? A participant will get exactly one balloon for each problem he/she solves during the contest. As AIUB students are very smart they all have the ability to solve all the problems claiming maximum number of balloons. Now ACC is worried about the amount of money they will need to buy all those balloons.

There will be P problems in the contest and N students will solve them. Each balloon costs C tk. Given this information you will have to find the maximum amount of money organizers will need to buy all the balloons.

Input

Only one line of input consisting three integers N P C denoting the number of students, number of problems and the price of each balloon respectively.

Output

One integer denoting the maximum amount of money to buy all the balloons.

Constraints

1 ≤ N ≤ 200

1 ≤ P ≤ 10

1 ≤ C ≤ 50

Example

Input:
5 2 2

Output:
20