atcoder#ABC265A. [ABC265A] Apple

[ABC265A] Apple

Score : 100100 points

Problem Statement

A fruit store sells apples. You may perform the following operations as many times as you want in any order:

  • Buy one apple for XX yen (the currency in Japan).
  • Buy three apples for YY yen.

How much yen do you need to pay to obtain exactly NN apples?

Constraints

  • 1XY1001 \leq X \leq Y \leq 100
  • 1N1001 \leq N \leq 100
  • All values in input are integers.

Input

Input is given from Standard Input in the following format:

XX YY NN

Output

Print the answer as an integer.

10 25 10
85

Buy three apples for 2525 yen three times and one apple for 1010 yen, and you will obtain exactly 1010 apples for a total of 8585 yen. You cannot obtain exactly 1010 apples for a lower cost, so the answer is 8585 yen.

10 40 10
100

It is optimal to buy an apple for 1010 yen 1010 times.

100 100 2
200

The only way to obtain exactly 22 apples is to buy an apple for 100100 yen twice.

100 100 100
3400