output_description: When the minimum fee is x yen, print the value of x.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N A B
attempt: # coding: utf-8
  # user: herp_sy
  
  
  def quicksort(seq):
      if len(seq) < 1:
          return seq
      pivot = seq[0]
      left = []
      right = []
      for x in range(1, len(seq)):
          if seq[x] <= pivot:
              left.append(seq[x])
          else:
              right.append(seq[x])
      left = quicksort(left)
      right = quicksort(right)
      foo = [pivot]
      return left + foo + right
  
  
  # , = map(int, input.split())
  #  = int(input())
  
  n, a, b = map(int, input().split())
  if n * a < b:
      print(n * a)
  else:
      print(b)
  
problem_description: 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.
samples: [{"input": "7 17 120", "output": "119\n    \n\n  * If you choose Plan 1, the fee will be 7\u00d717=119 yen.\n  * If you choose Plan 2, the fee will be 120 yen.\n\nThus, the minimum fee is 119 yen.\n\n* * *"}, {"input": "5 20 100", "output": "100\n    \n\nThe fee might be the same in the two plans.\n\n* * *"}, {"input": "6 18 100", "output": "100"}]