Problem:
Score : 100 points

Problem Statement

You are parking at a parking lot. You can choose from the following two fee plans:

Plan 1: The fee will be A×T yen (the currency of Japan) when you park for T hours.

Plan 2: The fee will be B yen, regardless of the duration.

Find the minimum fee when you park for N hours.

Constraints

1≤N≤20

1≤A≤100

1≤B≤2000

All input values are integers.

Input

Input is given from Standard Input in the following format:

N A B

Output

When the minimum fee is x yen, print the value of x.

Sample Input 1

7 17 120

Sample Output 1

119

If you choose Plan 1, the fee will be 7×17=119 yen.

If you choose Plan 2, the fee will be 120 yen.

Thus, the minimum fee is 119 yen.

Sample Input 2

5 20 100

Sample Output 2

100

The fee might be the same in the two plans.

Sample Input 3

6 18 100

Sample Output 3

100

Solution in JavaScript (node.js v5.12) (judge verdict: Wrong Answer)

    // inputに入力データ全体が入る
    function Main(input) {
    	// 1行目がinput[0], 2行目がinput[1], …に入る
    	input = input.split("\n");
      tmp = input[0].split(" ");
      
    	//文字列から10進数に変換するときはparseIntを使います
    	var N = parseInt(tmp[0], 10);
    	var A = parseInt(tmp[1], 10);
    	var B = parseInt(tmp[2], 10);

      var CalcA = A * N;

      if( CalcA >= B){
      	console.log('%d',CalcA);
      }else{
        console.log('%d',B);
      }

    	//出力
    	//console.log('%d %s',a+b+c,s);
    }

    Main(require("fs").readFileSync("/dev/stdin", "utf8"));