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 (Python):
N,A,B=map(int,input().split())

NA=N*A

if NA<B:
  print(NA)
else:
  print(B)

Solution (Python):
N,A,B = map(int,input().split())

print(min(N*A,B))

Solution (Python):
a,b,t=map(int,input().split())
print(min(a*b,t))

Solution (Python):
n,a,b=map(int,input().split())

print(min(a*n,b))

Solution (Python):
n, a, b = map(int, input().split())

A = n * a
print(min(A, b))

Solution (Python):
n,a,b = map(int, input().split())

x = min(n*a,b)

print(x)

Solution (Python):
N, A, B = map(int, input().split())
print(min(N*A, B))

Solution (Python):
n,a,b = map(int,input().split())

if n * a <= b:
    print(n * a)
else:
    print(b)

Solution (Python):
N, A, B = list(map(int, input().split()))
p1 = A * N
p2 = B
print(min(p1, p2))

Solution (Python):
n,a,b = map(int,input().split())
print(min(b,n*a))

Solution (Python):
N,A,B = map(int,input().split())
print(min(N*A,B))

Solution (Python):
n, a, b= map(int, input().split())
if n * a >= b:
  print(b)
else:
  print(n * a)

Solution (Python):
n,a,b=map(int,input().split())
if n*a>=b:
    print(b)
else:
    print(n*a)

Solution (Python):
n, a, b = map(int, input().split())
print(min(n * a, b))

Solution (Python):
n, a, b = map(int, input().split())
print(min(n*a, b))

Solution (Python):
n,a,b=map(int, input().split())
print(min(n*a, b))

Solution (Python):
N, A, B = map(int, input().split())
print(min(N*A, B))

Solution (Python):
n,a,b=map(int,input().split())
if n*a<b:
    print(n*a)
else:
    print(b)

Solution (Python):
n,a,b=map(int,input().split())
if n*a>b:
    print(b)
else:
    print(n*a)

Solution (Python):
n,a,b=map(int,input().split())
print(n*a if n*a<=b else b)

Solution (Python):
n,a,b = map(int,input().split())
print(min(n*a,b))

Solution (Python):
a,s,d=map(int,input().split());print(min(a*s,d))

Solution (Python):


import sys






























def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    n, a, b = mi()
    print(min(n * a, b))


if __name__ == "__main__":
    main()

Solution (Python):
n,a,b=map(int,input().split())

p1=a*n
p2=b

print(min(p1,p2))

Solution (Python):
N, A, B = map(int, input().split())
print(min(A*N, B))

Solution (Python):
N, A, B = list(map(int, input().split()))
print(min(N*A, B))

Solution (Python):
N,A,B = map(int,input().split());print(min(A*N,B))

Solution (Python):
N, A, B = map(int, input().split())
print(min(A*N, B))

Solution (Python):
N, A, B = map(int, input().split())
print(min(N*A, B))

Solution (Python):
n, a, b = list(map(int, input().split()))

print(min([n * a, b]))

Solution (Python):
x = input().split()
n = int(x[0])
a = int(x[1])
b = int(x[2])
if n*a >= b:
  print(b)
else:
  print(n*a)

Solution (Python):
n,a,b=map(int,input().split())
print(min(a*n,b))

Solution (Python):
import sys
import bisect
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline

def main():
    n,a,b = map(int,read().split())
    print(min(a*n,b))
    
if __name__ == '__main__':
    main()

Solution (Python):
n, a, b = map(int, input().split())
print(min(a*n, b))

Solution (Python):
N,A,B=map(int,input().split())
print(min(B,N*A))

Solution (Python):
n, a, b = map(int, input().split())

print(min(n * a, b))

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

n, a, b = map(int, readline().split())

print(min(n*a, b))

Solution (Python):
n, a, b = map(int, input().split())

print(min(n * a, b))

Solution (Python):
N,A,B = map(int,input().split())
print(min(N*A,B))

Solution (Python):
n,a,b=map(int,input().split())
print(min(n*a,b))

Solution (Python):
n, a, b = map(int, input().split())
if n*a < b :
    print(n*a)
else :
    print(b)

Solution (Python):
x, y, z = map(int, input().split())
if x * y < z:
    print(x*y)
else:
    print(z)

Solution (Python):
N, A, B = map(int,input().split())
print(min(N*A,B))

Solution (Python):
a,t,i=input().split()
a=int(a)
t=int(t)
x=a*t
i=int(i)
c=min(x,i)
print(c)

Solution (Python):
n,a,b=map(int,input().split())
print(min(n*a,b))

Solution (Python):
zikan,tanka,ryoukinB=map(int,input().split())
ryoukinA=tanka*zikan
ans=min(ryoukinA,ryoukinB)
print(ans)

Solution (Python):
n,a,b=map(int,input().split())
print(min(a*n,b))

Solution (Python):
n,a,b = map(int,input().split())
if n*a > b:
	print(b)
else:
	print(n*a)

Solution (Python):
a,b,c = map(int,input().split())
print(min(a*b,c))

Solution (Python):
n, a, b = map(int, input().split())

print(min(n * a, b))

Solution (Python):
n, a, b = list(map(int, input().split()))
print(min(n * a, b))

Solution (Python):
N,A,B=map(int,input().split())
if N*A>=B:
    print(B)
else:
    print(N*A)

Solution (Python):
n,a,b = map(int, input().split())
if n*a <= b:
  print(n*a)
else:
  print(b)

Solution (Python):
n,a,b = map(int,input().split())
print (min(n*a,b))

Solution (Python):
n,a,b = map(int, input().split())
print(min(n*a,b))

Solution (Python):
n, a, b = map(int, input().split())
print(min(n * a, b))

Solution (Python):

N, A, B = map(int, input().split())
print(min(N * A, B))

Solution (Python):
n,a,b = map(int,input().split())
print(min(b,a*n))

Solution (Python):
n, a, b = map(int, input().split())
print(min(a * n, b))

Solution (Python):

"""
Created on Thu May 14 01:20:03 2020

@author: shinba
"""

n,a,b = map(int,input().split())

if n*a >= b:
    print(b)
else:
    print(a*n)

Solution (Python):
a,b,c=map(int,input().split())
n=[a*b,c]
n=sorted(n)
print(n[0])

Solution (Python):
n, a, b = map(int, input().split())
print(min(a * n, b))

Solution (Python):
N,A,B=map(int,input().split())
if A*N<=B:
    print(A*N)
else:
    print(B)

Solution (Python):






import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache






MOD = 10**9+7
INF = float('inf')






def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]


def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr


def lcm(a, b):
    return a * b // gcd (a, b)





N,A,B = inputIL()

print(min(N*A,B))

Solution (Python):
n,a,b = map(int, input().split())

if n*a < b:
    print(n*a)
else:
    print(b)

Solution (Python):

import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

def main():
    N,A,B=map(int,input().split())
    print(min(A*N,B))

if __name__ == '__main__':
    main()

Solution (Python):
import sys
import math
import bisect
 
def main():
    n, a, b = map(int, input().split())
    print(min(n * a, b))
 
if __name__ == "__main__":
    main()

Solution (Python):
N,A,B = map(int,input().split())

tmp = N*A
if tmp <= B:
    print(tmp)
else:
    print(B)

Solution (Python):
n,a,b=map(int,input().split())
print(min(a*n, b))

Solution (Python):
import sys

def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list(map(lambda x: x-1, MII()))

def DD2(d1,d2,init=0): return [[init]*d2 for _ in range(d1)]
def DD3(d1,d2,d3,init=0): return [DD2(d2,d3,init) for _ in range(d1)]

def to_bin(x: int) -> str: return format(x, 'b') 
def to_oct(x: int) -> str: return format(x, 'o') 
def to_hex(x: int) -> str: return format(x, 'x') 
MOD=10**9+7
def divc(x,y) -> int: return -(-x//y)
def divf(x,y) -> int: return x//y
def gcd(x,y):
    while y: x,y = y,x%y
    return x
def lcm(x,y): return x*y//gcd(x,y)
def enumerate_divs(n):
    """Return a tuple list of divisor of n"""
    return [(i,n//i) for i in range(1,int(n**0.5)+1) if n%i==0]
def get_primes(MAX_NUM=10**3):
    """Return a list of prime numbers n or less"""
    is_prime = [True]*(MAX_NUM+1)
    is_prime[0] = is_prime[1] = False
    for i in range(2, int(MAX_NUM**0.5)+1):
        if not is_prime[i]: continue
        for j in range(i*2, MAX_NUM+1, i): is_prime[j] = False
    return [i for i in range(MAX_NUM+1) if is_prime[i]]
def prime_factor(n):
    """Return a list of prime factorization numbers of n"""
    res = []
    for i in range(2,int(n**0.5)+1):
        while n%i==0: res.append(i); n //= i
    if n != 1: res.append(n)
    return res

from itertools import accumulate as acc, combinations as combi, product, combinations_with_replacement as combi_dup
from collections import deque, Counter
from heapq import heapify, heappop, heappush
from bisect import bisect_left


def main():
    n, a, b = MII()
    print(min(n*a, b))

if __name__ == '__main__':
    main()

Solution (Python):
N,A,B = map(int,input().split())
print(min(N*A,B))

Solution (Python):
n,a,b = map(int, input().split())

print(min(n*a, b))

Solution (Python):
N, A, B = map(int, input().split())

if A * N > B:
  print(B)
else:
  print(A * N)

Solution (Python):
N,A,B=map(int,input().split())
print (min(A*N,B))

Solution (Python):
N,A,B = map(int, input().split())
print(min(A*N,B))

Solution (Python):
n, a, b = map(int, input().split())
print(min(n * a, b))

Solution (Python):
N,A,B=map(int,input().split())
P=A*N
if P>B:
  print(B)
else:print(P)

Solution (Python):
N,A,B=map(int,input().split())
print(min(A*N,B))

Solution (Python):
def resolve():
	n, a, b = map(int, input().split())
	print(min(a*n, b))
resolve()

Solution (Python):
N, A, B = map(int, input().split())
plan1 = A * N
plan2 = B
print(min(plan1, plan2))

Solution (Python):
def ABC_80_A():
    N,A,B = map(int, input().split())
    
    if A*N <= B:
        print(A*N)
    else:
        print(B)

if __name__ == '__main__':

    ABC_80_A()

Solution (Python):
N, A, B = map(int, input().split())
print(min(N*A, B))

Solution (Python):
N, A, B = list(map(int,input().split()))
print(min(N*A,B))

Solution (Python):
N, A, B = map(int, input().split())
print(min(A*N, B))

Solution (Python):

import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**7)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7
PI = math.pi

N, A, B = ri_()
print(min(A * N, B))

Solution (Python):

N, A, B = map(int, input().split())

print(min(A*N, B))

Solution (Python):
def main():
    n,a,b = (int(x) for x in input().split())
    print(min(b,a*n))

if __name__ == '__main__':
    main()

Solution (Python):
N,A,B = list(map(int,input().split()))
print(min(B,N*A))

Solution (Python):
N,A,B = map(int,input().split())
print(min(N*A,B))

Solution (Python):
t,a,b=map(int,input().split())
if a*t>b:
    print(b)
else:
    print(a*t)

Solution (Python):
n, a, b = map(int, input().split())
print(min(a*n, b))

Solution (Python):
n,a,b=map(int,input().split())

print(min(a*n,b))

Solution (Python):
a, b, c = map(int, input().split())
print(min(a*b, c))

Solution (Python):
N, A, B = map(int, input().split())

if (A * N) >= B:
    print(B)
else:
    print(A*N)

Solution (Python):
n,a,b=map(int,input().split())
print(min(n*a,b))

Solution (Python):
N, A, B = list(map(int, input().split()))
print(min(N*A, B))

Solution (Python):
n,a,b = map(int,input().split())
l = [n*a, b]
print(min(l))

Solution (Python):
n,a,b=map(int,input().split())
if n*a<b:
  print(n*a)
else:
  print(b)

Solution (Python):
n,a,b = map(int, input().split())
print(min(n*a,b))

Solution (Python):
n, a, b = map(int, input().split())

print(min(a*n, b))

Solution (Python):
n, a, b = map(int, input().split())
v = a*n

if v < b:
    print(v)
else:
    print(b)

Solution (Python):
n,a,b=map(int,input().split())
print(min(a*n,b))

Solution (Python):


N, A, B = map(int, input().split())

print(min(A*N, B))

Solution (Python):
n, a, b = map(int, input().split())
print(min(n * a, b))

Solution (Python):
n,a,b=map(int,input().split())
p1=n*a
p2=b
print(min(p1,p2))

Solution (Python):
n,a,b = map(int,input().split())
print(min(n*a,b))

Solution (Python):
n,a,b = map(int, input().split())
print(min(b, a*n))

Solution (Python):
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections

n,a,b = map(int,input().split())
ans = min(a*n,b)
print(ans)

Solution (Python):
n, a, b = map(int, input().split())

print(a*n if a*n < b else b)

Solution (Python):
a,b,c=map(int,input().split())
if a*b<c:
  print(a*b)
else:
  print(c)

Solution (Python):
n, a, b = list(map(int, input().split()))
print(min(n * a, b))

Solution (Python):
n, a, b = map(int, input().split())
if n*a >= b:
  print(b)
else:
  print(n*a)

Solution (Python):
N,A,B = map(int,input().split())

print(min(N*A,B))

Solution (Python):
a,b,c=map(int,input().split())
print(min(a*b,c))

Solution (Python):
N, A, B = map(int, input().split())
print(min(N*A, B))

Solution (Python):
n,a,b = map(int,input().split())

print(min(a*n,b))

Solution (Python):
n, a, b = map(int, input().split())
print(min(n*a, b))

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N, A, B = MAP()
print(min(A*N, B))

Solution (Python):
N,A,B = map(int,input().split())

if N*A <= B:
  print(N*A)
else:
  print(B)

Solution (Python):
n,a,b=map(int,input().split())
print(min([n*a,b]))

Solution (Python):
n,a,b=map(int,input().split())
print(min(a*n,b))

Solution (Python):
x = input().split()
n = int(x[0])
a = int(x[1])
b = int(x[2])
if n*a >= b:
  print(b)
else:
  print(n*a)

Solution (Python):
N,A,B = map(int,input().split())
if N*A>=B:
    print(B)
elif N*A<B:
    print(N*A)

Solution (Python):
N,A,B = map(int, input().split())
C= A*N
if C>=B:
 print(B)
else:
 print(C)

Solution (Python):
n,a,b = map(int, input().split())
print(min(a*n,b))

Solution (Python):
n,a,b = map(int, input().split())
print(min(n*a, b))

Solution (Python):


n, a, b = map(int, input().split())
print(min(a * n, b))

Solution (Python):
N, A, B = map(int, input().split())
S = N*A
if B < S or B == S:
  print(B)
else:
  print(S)

Solution (Python):
N,A,B=map(int,input().split())
print(min(N*A,B))

Solution (Python):
n,a,b=map(int,input().split())
print(n*a if n*a<b else b)

Solution (Python):
n,a,b=map(int,input().split())
print(min(n*a,b))

Solution (Python):
n,a,b = map(int, input().split())
print(min(a*n, b))

Solution (Python):
n,a,b=map(int,input().split())
print(min(n*a,b))

Solution (Python):
import sys
import os
import math
import string

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: x * y / math.gcd(x, y)

MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    N, A, B = il()
    print(min(A*N, B))


if __name__ == '__main__':
    main()

Solution (Python):
N, A, B = map(int, input().split())
print(min(N*A, B))

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque

from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil,pi

from copy import deepcopy
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [LI()for i in range(n)]
inf = 10**17
mod = 10**9 + 7

n,a,b=MI()
print(min(a*n,b))

Solution (Python):
N, A, B = map(int, input().split())
if A*N > B:
  print(B)
if A*N <= B:
  print(A*N)

Solution (Python):
n, a, b = map(int, input().split())
print(a * n if a * n <= b else b)

Solution (Python):
n, a, b = map(int, input().split())
print(min(n*a, b))

Solution (Python):
n,a,b=[int(i) for i in input().split()]
c=n*a
if c>=b:
  print(b)
else:
  print(c)

Solution (Python):
n,a,b = map(int, input().split())
print(min(n*a,b))

Solution (Python):
n,a,b = map(int,input().split())
print(min(n*a,b))

Solution (Python):
n, a, b = [int(i) for i in input().split()]
print(min(n*a,b))

Solution (Python):
n, a, b = map(int, input().split())
ans = min(a*n, b)
print(ans)

Solution (Python):
n, a, b = map(int, input().split())

print(min(a * n, b))

Solution (Python):
n, a, b = map(int, input().split())
if n*a > b:
    print(b)

else:
    print(n*a)

Solution (Python):
N,A,B=map(int,input().split())
s=N*A
print(min(s,B))

Solution (Python):
N, A, B = map(int, input().split())
if A * N > B:
    print(B)
else:
    print(A*N)

Solution (Python):
N, A, B = map(int,input().split())
print(min(N * A, B))

Solution (Python):
N, A, B = map(int, input().split())
print(min(N*A, B))

Solution (Python):
n,a,b=map(int,input().split())
print(min(a*n,b))

Solution (Python):
n,a,b= map(int,input().split())
print(b if b<=a*n else a*n)

Solution (Python):
a,b,t=map(int, input().split())
print(min([a*b,t]))

Solution (Python):
x, y, z = map(int,input().split())

print(min(x*y, z))

Solution (Python):
hours, hourly, full = map(int, input().split())

print(min([hourly*hours, full]))

Solution (Python):

def resolve():
    N, A, B = list(map(int, input().split()))
    print(B if N * A > B else N * A)


if '__main__' == __name__:
    resolve()

Solution (Python):
a,b,c=map(int,input().split())

print(min(a*b,c))

Solution (Python):
n,a,b = map(int,input().split())
print(a*n if a*n < b else b)

Solution (Python):
a,b,c = list(map(int,input().split()))
print(min(a*b,c))

Solution (Python):
n,a,b=map(int,input().split())
f=n*a
if(f<b):
  print(f)
else:
  print(b)

Solution (Python):
def main():
    N, A, B = map(int, input().split())
    if N*A <= B:
        print(N*A)
    else:
        print(B)
main()

Solution (Python):
N,A,B=map(int,input().split())
if N*A>B:
    print(B)
else:
    print(N*A)

Solution (Python):
N, A, B = map(int,input().split())

li = [ N*A, B]

print(min(li))

Solution (Python):
N, A, B = map(int,input().split())

if N*A >= B:
  print(B)
  
else:
  print(A*N)

Solution (Python):
n,a,b=map(int,input().split())
if n*a<=b:
    print(n*a)
else:
    print(b)

Solution (Python):
N,A,B = map(int, input().split())
ans = min(N * A, B)
print(ans)

Solution (Python):
x=[int(a) for a in input().split()]
print(min(x[0]*x[1],x[2]))

Solution (Python):
n,a,b = map(int,input().split())
print(min(n*a, b))

Solution (Python):
N, A, B = map(int, input().split())

ans = min( N * A, B )

print(ans)

Solution (Python):
n,a,b=map(int,input().split())
print(min(a*n,b))

Solution (Python):
n,a,b = map(int,input().split())
print(min(a*n,b))

Solution (Python):
n, a, b = map(int, input().split())

print(min(n * a, b))

Solution (Python):
icase=0    
if icase==0:
    n,a,b=map(int,input().split())
    print(min(a*n,b))

Solution (Python):
n,a,b = map(int, input().split())
print(b if b < n*a else n*a)

Solution (Python):





n, a, b = map(int, input().split())
planA = n * a
planB = b
if planA >= planB:
    print(planB)
else:
    print(planA)

Solution (Python):
n,a,b = map(int,input().split())
print(min(a*n,b))

Solution (Python):
n,a,b=map(int,input().split())
print(min(n*a,b))

Solution (Python):
N, A, B = map(int, input().split())
print(min(B, A*N))

Solution (Python):

n,a,b=map(int,input().split())

if a*n>=b:
    print(b)
else:
    print(a*n)

Solution (Python):
n, a, b = map(int, input().split())

if n * a <= b:
    print(n*a)
else:
    print(b)

Solution (Python):
N,A,B = map(int,input().split())

print(min(N*A,B))

Solution (Python):
N, A, B = map(int, input().split())
print(min(N*A, B))

Solution (Python):
n,a,b=map(int,input().split())
print(min(n*a,b))

Solution (Python):
n,a,b=map(int,input().split())
print(min(a*n,b))

Solution (Python):
N,A,B =map(int,input().split())
print(min(N*A,B))

Solution (Python):
N, A, B = map(int, input().split())
print(min(A*N, B))

Solution (Python):
N, A, B = map(int, input().split())
print(min(N*A, B))

Solution (Python):
n, a, b = map(int, input().split())
print(min(n * a, b))

Solution (Python):
N, A, B = map(int, input().split())
print(min(N*A, B))

Solution (Python):
n,m,k = map(int,input().split())
print(min(n*m,k))

Solution (Python):
N,A,B=input().split()
N=int(N)
A=int(A)
B=int(B)

ans1=A*N
ans2=B


if ans1<ans2:
    print(ans1)
else:
    print(ans2)

Solution (Python):
n, a, b = map(int, input().split())
print(min(n*a, b))

Solution (Python):
n,a,b= map(int,input().split())
print(min(a*n,b))

Solution (Python):
NAB = list(map(int, input().split()))
ans = min(NAB[0]*NAB[1],NAB[2])
print(ans)

Solution (Python):
N, A, B = map(int, input().split())
print(min(N * A, B))

Solution (Python):
N, A, B = map(int, input().split())

print(min(N*A, B))

Solution (Python):
N, A, B = map(int, input().split())
print(min(N*A, B))

Solution (Python):
N, A, B=map(int, input().split())
if(N*A<=B):
  print(N*A)
else:
  print(B)

Solution (Python):
n, a, b = map(int,input().split())
print(min(n*a, b))

Solution (Python):
n,a,b = map(int,input().split())
print(min(n*a,b))

Solution (Python):
n,a,b = map(int,input().split())
print(min(n*a,b))

Solution (Python):
n,a,b=[int(i) for i in input().split()]

one=n*a
two=b

if one>two:
    print(two)
else:
    print(one)

Solution (Python):
n,a,b = map(int, input().split())

print(min(a*n, b))

Solution (Python):
N, A, B = map(int, input().split())
print(N*A if N*A<B else B)

Solution (Python):

import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)

n, a, b = map(int,readline().split())
print(min(n * a, b))

Solution (Python):
n, a, b = map(int, input().split())
print(min(n * a, b))

Solution (Python):
N,A,B = map(int,input().split())

print(min(N*A,B))

Solution (Python):
n, a, b = [int(x) for x in input().split()]

ans = min((n * a), b)
print(ans)

Solution (Python):
n,a,b=map(int,input().split())
print(min(n*a,b))

Solution (Python):
n,a,b = map(int,input().split())
print(min(n*a, b))

Solution (Python):
n,a,b= map(int, input().split())
print(min(a*n,b))

Solution (Python):

n,a,b = map(int,input().split())

print(min(a*n,b))

Solution (Python):
n,a,b = map(int,input().split())
print(min(n*a,b))

Solution (Python):
a,b,c=map(int, input().split())
print(min(a*b,c))

Solution (Python):
n, a, b = map(int, input().split())
print(min(n*a, b))

Solution (Python):
n, a, b = [int(x) for x in input().split()]
print(min(n * a, b))

Solution (Python):

N, A, B = map(int, input().split())
ans1 = A * N
ans2 = B
print(min(ans1, ans2))

Solution (Python):
N, A, B = map(int, input().split())

print(min(A*N, B))

Solution (Python):
t, a, b = map(int, input().split())
print(min(t*a,b))

Solution (Python):
def main():
    n, a, b = map(int, input().split())
    ans = min(n*a, b)
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
N, A, B = map(int, input().split())

if N * A > B:
  print(B)
else:
  print(N * A)

Solution (Python):
n,a,b=map(int,input().split())
print(n*a if n*a<=b else b)

Solution (Python):
N,A,B = map(int,input().split())

if N * A <= B:
	answer = N * A
else:
	answer = B

print(answer)

Solution (Python):
n, a, b = map(int,input().split())
print(min(a*n,b))

Solution (Python):
import sys

n, a, b = map(int, sys.stdin.readline().split())

def main():
    ans = min(n * a, b)
    print(ans)

if __name__ ==  '__main__':
    main()

Solution (Python):
N, A, B = map(int, input().split())  
print(min(N*A,B))

Solution (Python):
N, A, B = map(int, input().split())  

C = N * A

if C <= B:
  print(C)
else:
  print(B)

Solution (Python):

n, a, b = [int(s) for s in input().split()]
print(min(a * n, b))

Solution (Python):
n,a,b = map(int, input().split())

if n*a <= b:
    print(n*a)
else:
    print(b)

Solution (Python):
N, A, B = map(int, input().split())
print(min(A*N, B))

Solution (Python):
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

if __name__ == '__main__':
    a = [int(i) for i in input().split()]
    num = min (a[0]*a[1],a[2])
    print(num)

Solution (Python):
n, a, b = map(int, input().split())
print(min(a*n, b))

Solution (Python):
N, A, B = map(int, input().split())

print(min(B, A * N))

Solution (Python):
n, a, b = map(int, input().split())

ans = []
ans.append(n*a)
ans.append(b)

print(min(ans))

Solution (Python):
N, A, B = map(int, input().split())
print(min(N * A, B))

Solution (Python):
N,A,B= map(int,input().split())
print(min(N*A,B))

Solution (Python):
import math

n,a,b=map(int,input().split())

print(min(a*n,b))

Solution (Python):
N,A,B=map(int,input().split());print(min(N*A,B))

Solution (Python):
n,a,b=map(int,input().split())
print(min(n*a,b))

Solution (Python):
N, A, B = map(int, input().split())
print(min(N * A, B))

Solution (Python):
N, A, B = map(int, input().split())
print(min(N*A, B))

Solution (Python):
tmp = input().split()
val = [int(v) for v in tmp]
if val[0] * val[1] >= val[2]:
  ans = val[2]
else:
  ans = val[0] * val[1]
print(ans)

Solution (Python):
N, A, B = map(int,input().split())

print(min(N*A,B))

Solution (Python):
n,a,b = map(int,input().split())
print(min(n*a,b))

Solution (Python):
n,a,b=map(int,input().split())
print(min(a*n,b))

Solution (Python):
N,A,B=map(int,input().split())
print(min(A*N,B))

Solution (Python):
N,A,B = map(int,input().split())
print(min(A*N,B))

Solution (Python):
N,A,B = map(int,input().split())
print(min(A*N,B))

Solution (Python):
n, a, b = [int(i) for i in input().split()]
p1 = a*n
p2 = b
print(min(p1, p2))

Solution (Python):
t,a,b=map(int,input().split())
print(min(t*a,b))

Solution (Python):
N,A,B = map(int,input().split(" "))
print(min(N*A,B))

Solution (Python):
N, A, B = map(int, input().split())
print(min(N*A, B))

Solution (Python):
N,A,B=map(int,input().split())

print(min(A*N,B))

Solution (Python):
n,a,b=map(int, input().split())
if a*n>b:
  print(b)
else:
  print(a*n)

Solution (Python):
import math

N,A,B=list(map(int, input().split()))

if N*A<B:
    print(N*A)
else:
    print(B)

Solution (Python):
n,a,b = map(int,input().split())
print(min(n*a,b))

Solution (Python):
n,a,b=map(int,input().split())

print(min(n*a,b))

Solution (Python):
a,b,c=map(int,input().split())
if a*b<c:
  print(a*b)
else:
  print(c)

Solution (Python):
n,a,b=map(int,input().split())
print(min(a*n,b))

Solution (Python):
n,a,b=map(int,input().split())
print(min(n*a,b))

Solution (Python):
n, a, b = map(int, input().split())

if n * a <= b:
    print(n * a)
else:
    print(b)

Solution (Python):
n, a, b = map(int, input().split())
print(min(n*a,b))

Solution (Python):
n,a,b=(map(int,input().split()))
print(n*a if n*a<=b else b)

Solution (Python):
import math
import string


def readints():
    return list(map(int, input().split()))


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor



dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]








n, a, b = map(int, input().split())
print(min(a*n, b))

Solution (Python):
n, a, b = map(int, input().split())
print(min(n * a, b))

Solution (Python):
n, a, b = map(int, input().split())
print(min(n * a, b))

Solution (Python):
l = [int(x) for x in input().split(' ')]
print(min(l[0]*l[1],l[2]))