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: ###==================================================
  ### import
  # import bisect
  # from collections import Counter, deque, defaultdict
  # from copy import deepcopy
  # from functools import reduce, lru_cache
  # from heapq import heappush, heappop
  # import itertools
  # import math
  # import string
  import sys
  
  
  ### stdin
  def input():
      return sys.stdin.readline().rstrip()
  
  
  def iIn():
      return int(input())
  
  
  def iInM():
      return map(int, input().split())
  
  
  def iInM1():
      return map(int1, input().split())
  
  
  def iInLH():
      return list(map(int, input().split()))
  
  
  def iInLH1():
      return list(map(int1, input().split()))
  
  
  def iInLV(n):
      return [iIn() for _ in range(n)]
  
  
  def iInLV1(n):
      return [iIn() - 1 for _ in range(n)]
  
  
  def iInLD(n):
      return [iInLH() for _ in range(n)]
  
  
  def iInLD1(n):
      return [iInLH1() for _ in range(n)]
  
  
  def sInLH():
      return list(input().split())
  
  
  def sInLV(n):
      return [input().rstrip("\n") for _ in range(n)]
  
  
  def sInLD(n):
      return [sInLH() for _ in range(n)]
  
  
  ### stdout
  def OutH(lst, deli=" "):
      print(deli.join(map(str, lst)))
  
  
  def OutV(lst):
      print("\n".join(map(str, lst)))
  
  
  ### setting
  sys.setrecursionlimit(10**6)
  ### utils
  int1 = lambda x: int(x) - 1
  ### constants
  INF = int(1e9)
  MOD = 1000000007
  dx = (-1, 0, 1, 0)
  dy = (0, -1, 0, 1)
  ###---------------------------------------------------
  
  N, A, B = iInM()
  
  ans = min(A * N, B)
  
  pritn(ans)
  
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"}]