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())
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):
ri = lambda: int(input())
rl = lambda: list(map(int,input().split()))
rr = lambda N: [ri() for _ in range(N)]
YN = lambda b: print('YES') if b else print('NO')
yn = lambda b: print('Yes') if b else print('No')
OE = lambda x: print('Odd') if x%2 else print('Even')
INF = 10**18

n,a,b=rl()

print(min(a*n,b))

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

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

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

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

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(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())
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=[int(i) for i in input().split()]
print(min(b,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())
if N*A>=B:
  print(B)
else:
  print(N*A)

Solution (Python):
from sys import stdin
a, b, c = [int(x) for x in stdin.readline().rstrip().split()]
if (a*b)>c:
  print(c)
else:
  print(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())
ans = min(a*n,b)
print(ans)

Solution (Python):
n,a,b=map(int,input().split())
c=n*a
if c>=b:
    print(b)
else:
    print(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(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 = input().split()
N = int(N)
A = int(A)
B = int(B)

print(min(N*A, B))

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

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

Solution (Python):
N, A, B = [ int(x) for x in input().split() ]

ans = min(A * N , B)

print(ans)
print()

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(A*N,B))

Solution (Python):
import math
import numpy as np
import sys
input = sys.stdin.readline
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

N,A,B = IL()

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(n*a,b))

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

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

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):
l = [ int(i) for i in input().split()]
if l[0]*l[1]<l[2]:
    print(l[0]*l[1])
else:
    print(l[2])

Solution (Python):
t,a,b=map(int,input().split())
print(min(a*t,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):
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(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(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 = map(int, 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())

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

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

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

Solution (Python):
int_t, int_a, int_b = map(int, input().split())

print(int_t * int_a if int_t * int_a <= int_b else int_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())
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):
a,b,c = map(int,input().split())
if a*b <= c:
    print(a*b)
else:
    print(c)

Solution (Python):
nab = list(int(i) for i in input().split())
if nab[0] * nab[1] < nab[2]:
    print(nab[0] * nab[1])
else:
    print(nab[2])

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):
a,b,c = map(int, input().split())
print(min(a*b,c))

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

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

parking = lambda total, B: total if  total < B else B
total = N*A
print(parking(total, B))

Solution (Python):
""" AtCoder """

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):
def ma():return map(int, input().split())
x,y,z = ma()
print(min(x*y,z))

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):
def main(N, A, B):
    if N * A <= B:
        print(N * A)
    else:
        print(B)

if __name__ == '__main__':
    N, A, B = list(map(int, input().split(' ')))
    main(N, A, B)

Solution (Python):
N,A,B = map(int,input().strip().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(B if N*A>B else 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):
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):
import math
n=list(map(int,input().split()))
if (n[0]*n[1])<n[2]:
    print(n[0]*n[1])
else:
    print(n[2])

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= (int(i) for i in input().split())
print(min(n*a,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):

n,a,b = list(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 = 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):
a,b,c=map(int,input().split())
print(min(a*b,c))

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(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())
ans = min(N * A,B)
print(ans)

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())
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())
a = A * N
if(a > B):
  print(B)
else:
  print(a)

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

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


abc080_a()

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

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


if __name__ == '__main__':
    main()

Solution (Python):
l,m,n=map(int,input(" ").split())
if l*m>=n:
  print(n)
else:
  print(l*m)

Solution (Python):
n, a, b = [int(i) for i in 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(a * n)
else:
    print(b)

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 A * N >= B:
  print(B)
else:
  print("{}".format(A*N))

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

Solution (Python):



def main():
    """Function."""
    n, a, b = map(int, input().split())
    if a*n < b:
        print(a*n)
    else:
        print(b)


if __name__ == "__main__":
    main()

Solution (Python):

print((lambda x: min(x[0] * x[1], x[2]))(list(map(int, input().split()))))

Solution (Python):
list = [int(i) for i in input().split()]

fee = list[0] * list[1]

print(min(fee, list[2]))

Solution (Python):
from statistics import mean, median,variance,stdev
import sys
import math

n=input().split()
a = []
for i in range(len(n)):
    a.append(int(n[i]))
if (a[0]*a[1]) < a[2]:
    print(a[0]*a[1])
else: print(a[2])

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

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())
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,N*A))

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

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

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

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()]
if (a*n < b) :
  print(a*n)
else :
  print(b)

Solution (Python):
[time, price_by_hour , constant_price] = list(map(int,input().split()))

if price_by_hour * time > constant_price:
	print(constant_price)
else:
	print(price_by_hour * time)

Solution (Python):
a,b,c = map(int,input().split(" "))
if a * b >= c:
  print(c)
else:
  print(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([N*A,B][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, A, B = [int(_) for _ in 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(N*A,B))

Solution (Python):
a=input().strip().split(" ")

b=[int(i) for i in a]

c=b[0]*b[1]

if(c>b[2]):
    print(b[2])
else:
    print(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):

"""
Created on Sun Nov  4 21:46:51 2018

@author: sk
"""


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

s1=a*b


if s1>=c:
  print(c)

else:
  print(s1)

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

Solution (Python):
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):
a = list(map(int,input().split()))
b = a[0] * a[1]
if a[2] <= b:
  print(a[2])
else:
  print(b)

Solution (Python):
N, A, B = [int(i) for i in input().split()]
print(B if N*A > B else 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(A*N, B))

Solution (Python):
a,b,c = map(int,input().split())
print(a*b if a*b < c else 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=(int(i) for i in 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())

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

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

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

Solution (Python):
N, A, B = map(int, input().split())
m1 = A*N
if m1 < B:
    print(m1)
else:
    print(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(N*A, B))

Solution (Python):
N, A, B = list(map(int, input().split()))
ans = min(A * N, 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(n*a,b))

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

print(B if N*A > B else 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(A*N,B))

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

print(min(a*n, b))

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

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(n * a)
else:{
    print(b)
}

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

Solution (Python):
a,b,c=map(int,input().split())
if a*b>c:
  print(c)
else:
  print(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(b, a*n))

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 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(n*a,b))

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

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

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())

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())
r=min(n*a,b)
print (r)

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

Solution (Python):
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):
n, a, b = list(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):


INF = float('inf')


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


N, A, B = inpl()

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())
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(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(A*N, B))

Solution (Python):
import math


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

if T*A>B:
    print(B)
else:
    print(T*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())
if n*a<=b:
    print(n*a)
else:print(b)

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

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

Solution (Python):


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

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

Solution (Python):


from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


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


if __name__ == '__main__':
    main()

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([a*n,b]))

Solution (Python):

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

Solution (Python):
import sys
import math
import collections
import itertools
import array
import inspect


sys.setrecursionlimit(10000)



def chkprint(*args):
    names = {
        id(v): k
        for k, v in inspect.currentframe().f_back.f_locals.items()
    }
    print(', '.join(
        names.get(id(arg), '???') + ' = ' + repr(arg) for arg in args))



def to_bin(x):
    return bin(x)[2:]


def li_input():
    return [int(_) for _ in input().split()]




dp = None


def main():
    N, A, B = li_input()

    print(min(N * A, B))


main()

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

Solution (Python):
N = list(map(int,input().split(" ")))
A = N[0]*N[1]
if N[2] > A:
    print(A)
else:
    print(N[2])

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):
n, a, b = map(int, input().split())
if a*n <= b:
    print(a*n)
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())

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

Solution (Python):
Data = list(map(int, input().split()))

print(min(Data[0]*Data[1],Data[2]))

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):
from collections import defaultdict
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
AtoZ = [chr(i) for i in range(65,65+26)]
atoz = [chr(i) for i in range(97,97+26)]

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

N,A,B = inpl()

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):
x, y, z = map(int, input().split())

a = x*y
if a >= z:
    print(z)
else:
    print(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(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())
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):


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

if __name__ == '__main__':
    main()

Solution (Python):
n, a, b = [int(m) for m in 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(id) for id in 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(b, n*a))

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

print(min(T*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(n*a if n*a < b else b)

Solution (Python):
money,time,allmoney = map(int,input().split())
product = money * time
print(product if product < allmoney else allmoney)

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

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

Solution (Python):

n=[int(i) for i in input().split()]
if(n[0]*n[1]<=n[2]):
  print(n[0]*n[1])
else:
  print(n[2])

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 = (int(x) for x in raw_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())
pA = N*A
if pA > B:
  print(B)
else:
  print(pA)

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,N*A))

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

if T * A >= B:
	print(B)
else:
	print(T * 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(" "))

aplan = n * a
bplan = b

if aplan > bplan:
    print(bplan)
else:
    print(aplan)

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

print min(n*a,b)

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

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

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

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

if(A*N <= B):
	print(A*N)
elif(A*N > B):
	print(B)

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



ans=[A*N, B]

print(min(ans))

Solution (Python):
[n,a,b]=[int(i) for i in 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 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):


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

print(min(T * A, B))

Solution (Python):
n,a,b=[int(n) for n in 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(a*b if a*b<=c else c)

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(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 = [int(i) for i in input().split()]
print(min(x[0]*x[1], x[2]))

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())

if N * A < B:
    print(N * A)
else:
    print(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 N*A > B:
  print(B)
else:
  print(N*A)

Solution (Python):
( times, a, b ) = list( map( int, input().split() ) )
print( a*times if( a*times < b ) else 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 N*A >= B :
    print("{}".format(B))
else:
    print('{}'.format(N*A))

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((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=[int(i) for i in input().split()]
a=A*N
b=B 
if a>=b:
    print(b)
else:
    print(a)

Solution (Python):
N,A,B = [int(num) for num in input().split()]
print(min(A*N,B))

Solution (Python):
N,A,B = [int(i) for i in input().split()]
s = N * A
t = B
if s > t :
  print(t)
elif s == t :
  print(t)
else :
  print(s)

Solution (Python):
n, a, b = [int(num) for num in 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().rstrip().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())
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
if p1<p2:
  print(p1)
else:
  print(p2)

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

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

if a[0]*a[1] >= a[2]:
  print(a[2])
else: print(a[0]*a[1])

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())

P1 = N*A
P2 = B

if P2 < P1:
    print(P2)
else:
    print(P1)

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):
def smaller(x, y):
	if x < y: return x
	else: return y

N, A, B = map(int, raw_input().split())
print smaller(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([n*a,b][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())
plan_a = a * n
if plan_a <= b:
    print(plan_a)
else:
    print(b)

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

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(B)
else:
    print(N * A)

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

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, B, C = map(int, input().split())
print (min(A*B, C))

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

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

p1 = n * a
p2 = b

if p2 < p1:
    print(p2)
else:
    print(p1)

Solution (Python):
N,A,B = map(int,input().split())
print(min(N*A,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())
print(min(b, a * n))