Problem:
 Score : 100 points    Problem Statement N of us are going on a trip, by train or taxi.  The train will cost each of us A yen (the currency of Japan).  The taxi will cost us a total of B yen.  How much is our minimum total travel expense?      Constraints  All values in input are integers.  1 \leq N \leq 20  1 \leq A \leq 50  1 \leq B \leq 50         Input Input is given from Standard Input in the following format:  N  A  B       Output Print an integer representing the minimum total travel expense.        Sample Input 1 4 2 9      Sample Output 1 8  The train will cost us 4 \times 2 = 8 yen, and the taxi will cost us 9 yen, so the minimum total travel expense is 8 yen.       Sample Input 2 4 2 7      Sample Output 2 7       Sample Input 3 4 2 8      Sample Output 3 8

Solution (Python):


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

print(min(b,a*n))

Solution (Python):

import sys


def solve(N: int, A: int, B: int):
    print(min(N*A, B))
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    A = int(next(tokens))  
    B = int(next(tokens))  
    solve(N, A, B)

if __name__ == '__main__':
    main()

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

    return min(N*A, B)

if __name__ == '__main__':
    print(main())

Solution (Python):

a=list(map(int, input().split()))
N=a[0]
A=a[1]
B=a[2]

train=A*N
taxi=B
ans=min(train,taxi)
print(ans)

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

print(min(n*a,b))

Solution (Python):
input_data = input().split(" ")

N = int(input_data[0])
A = int(input_data[1])
B = int(input_data[2])

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

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

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

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(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):
inp = [int(v) for v in input().split(' ')]
N = inp[0]
A = inp[1]
B = inp[2]

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

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

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

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

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

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

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







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):
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()
n=int(tmp[0])
a=int(tmp[1])
b=int(tmp[2])

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

Solution (Python):
intlist= [i for i in input().split()]
a = int(intlist[0])
b = int(intlist[1])
c = int(intlist[2])

print (min(a*b, c))

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


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

Solution (Python):

import sys


def solve(N: int, A: int, B: int):
    print(min(N * A, B))
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    A = int(next(tokens))  
    B = int(next(tokens))  
    solve(N, A, B)

if __name__ == '__main__':
    main()

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

train = n*a

if train > b:
    print(b)
else:
    print(train)

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,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(b)
else:
	print(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())

train = n * a
taxi = b

expense = [train,taxi]

print(min(expense))

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

Solution (Python):
from sys import stdin; input=stdin.readline
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=input().split()
N,A,B=int(N),int(A),int(B)

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

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

Solution (Python):
people,train,taxi=map(int,input().split())
print(min(train*people,taxi))

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 = (int(x) for x in input().split())

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

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

Solution (Python):
List = list(map(int,input().split()))
N = List[0]
A = List[1]
B = List[2]

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

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

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

Solution (Python):



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

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

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

Tr = N * A
Tx = B
print(min(Tr,Tx))

Solution (Python):
a = []
a = input().split()

N = int(a[0])
A = int(a[1])
B = int(a[2])

cost = 0

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

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

Solution (Python):

n = input()

N = int(n.split()[0])
A = int(n.split()[1])
B = int(n.split()[2])

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

else:
    print(int(A*N))

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

Solution (Python):
import sys
input = sys.stdin.readline

def func(people_num, train_fee, cab_fee):
    train = people_num*train_fee
    print(min(train, cab_fee))
    pass


def main():
    n, a, b = [int(i) for i in input().split()] 
    func(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(A*N,B))

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

Solution (Python):
x=input().split()
 
y=[0]*3
y[0]=int(x[0])
y[1]=int(x[1])
y[2]=int(x[2])
 
print(min(y[0]*y[1],y[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):

input = input().split()
a = int(input[0])
b = int(input[1])
c = int(input[2])

ans = 0
if a * b > c:
    ans = c
else:
    ans = 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())

train = a * n
taxi = b

if train > taxi:
    print(taxi)
else:
    print(train)

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

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


if __name__ == "__main__":
    test()

Solution (Python):
i = list(map(int,input().split()))
n = i[0] * i[1]

if n - i[2] <=0:
    print (n)
else:
    print(i[2])

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())
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):
IN=input()
num=IN.split(" ")
N,A,B=[int(s) for s in num]

cost=[]
costA=N*A
costB=B

cost=[costA,costB]

print(min(cost))

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

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

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

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())
taxi=b/n

if taxi<a:
    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 = 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())
Train = A * N

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

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

print(min(n*a,b))

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

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

res = min(n*a, b)

print(res)

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

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

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

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

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

A = A * N

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

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

Solution (Python):
list=input().split()

list=[int(n) for n in list]

if list[0]*list[1]<list[2]:
    print(list[0]*list[1])
else:
    print(list[2])

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

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


if __name__ == "__main__":
    print(solve())

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):
"""


     = sys.stdin.readline().rstrip()
     = list(sys.stdin.readline().rstrip())


     = int(sys.stdin.readline())
     = map(int, sys.stdin.readline().split())
     = list(map(int, sys.stdin.readline().split()))
     = [list(map(int,list(sys.stdin.readline().split()))) for i in range(h)]  


a = 100
b = 0.987654321
print("{0:06d}-{1:6f}".format(a,b))
000100-0.987654


char_list = list("abcd") 
"""

import math
import sys
import itertools
import queue
from fractions import gcd

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

mod = 1000000007

if __name__ == "__main__":
     N, A, B = map(int, sys.stdin.readline().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= (int(i) for i in input().split())  
train = N*A
if train < B:
	print(train)
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())
cost = min(a*n, b)
print(cost)

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

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

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

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

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

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 = [int(i) for i in input().split()]

train = N * A
ans = min(train, B)
print(ans)

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

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

train = N * A

if train > B :
  print(B)
else:
  print(train)

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

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

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

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

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

Solution (Python):

A = list(map(int,input().split()))
ans = A[0]*A[1]

if A[0]*A[1] > A[2]:
	ans = A[2]

print(ans)

Solution (Python):



def main():
    n,a,b = input().split(' ')
    n = int(n)
    a = int(a)
    b = int(b)

    ag = a*n

    print(min(ag,b))


if __name__ == "__main__":
    main()

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

if b > n * a:
    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):
n,a,b = map(int,raw_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(A*N)

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

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

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

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

Solution (Python):
import math


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

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

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

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

Solution (Python):
print((lambda x:x[0]*x[1]<x[2]and x[0]*x[1]or x[2])([int(i)for i in input().split(' ')]))

Solution (Python):


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

Solution (Python):

N,A,B = map(int,input().split())
train = N*A
taxi = B
result = train - taxi

if result >= 0:
    print(taxi)
else:
    print(train)

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

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

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

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

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

a *= n

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

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

Solution (Python):
n,a,b = list(map(int, input().split(' ')))
if a*n < b:
    print(a*n)
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,S,T=map(int,input().split())
Ssum = N*S
if Ssum > T:
  print(int(T))
else :
  print(Ssum)

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

tak = int(a) * int(b)
rail = int(c)

if tak < rail: 
	print( "%d" % tak )
else :
  	print( "%d" % rail )

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

Solution (Python):
temp=input().split()
N=int(temp[0])
A=int(temp[1])
B=int(temp[2])

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

Solution (Python):
a = input().split()
 
N = int(a[0])
A = int(a[1])
B = int(a[2])
 
if A * N  >= B:
  print (B)
else:
  print (A * N)

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

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

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())
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):
def taxi_or_train(N, A, B):
    return min(N*A, B)

if __name__ == "__main__":
    N, A, B = map(int, input().split(' '))
    print(taxi_or_train(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=(int(x) for x in input().split())
train=int(n*a)
taxi=(b)
print(min(train,taxi))

Solution (Python):
str = input("")
n, a, b = str.split(' ')

fare_taxy = int(b)
fare_bus = int(a) * int(n)

if fare_taxy < fare_bus:
    print(fare_taxy)
else:
    print(fare_bus)

Solution (Python):
n, train_price, taxi_price = map(int, input().split())
train_price = train_price * n

min_price = min([train_price, taxi_price])

print(min_price)

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

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

Solution (Python):
NAB =  list(map(int,input().split()))
n = NAB[0]
a = NAB[1]
b = NAB[2]

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

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


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

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

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

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

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline

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

if __name__ == '__main__':
	main()

Solution (Python):



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

train = a * n
taxi = b

ans = min([train, taxi])
print(ans)

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

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

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

main()

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

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

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

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

if (N*A == B):
    print(B)
    
else:
    ans = min(N*A, B)
    print(ans)

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

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

Solution (Python):
N, A, B = [int(_) for _ in 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):
import sys
def main():
    input = sys.stdin.readline
    NAB = list(map(int, input().split()))
    N = NAB[0]
    A = NAB[1]
    B = NAB[2]

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

if __name__ == '__main__':
    main()

Solution (Python):
inp = input().split(" ")
n = int(inp[0])
a = int(inp[1])
b = int(inp[2])

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

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

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

Solution (Python):
nab = [int(i) for i in input().split()]
n = nab[0]
a = nab[1]
b = nab[2]

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

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

Solution (Python):
people , train, taxi = [int(i) for i in input().split()]
train_fee = train * people
if train_fee <= taxi:
	print(train_fee)
else:
  print(taxi)

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

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

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

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

Solution (Python):
from copy import *
from sys import *
import math
import queue
from collections import defaultdict,Counter,deque
from fractions import Fraction as frac

setrecursionlimit(1000000)


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

def zip(a):
	mae = a[0]
	ziparray = [mae]
	for i in range(1,len(a)):
		if(mae != a[i]):
			ziparray.append(a[i])
			mae = a[i]
	return ziparray

def is_prime(n):
	if n < 2: return False

	for k in range(2, int(math.sqrt(n)) + 1):
		if n % k == 0:
			return False

	return True

def list_replace(n,f,t):
	return [t if i==f else i for i in n]

def base_10_to_n(X, n):
	X_dumy = X
	out = ''
	while X_dumy>0:
		out = str(X_dumy%n)+out
		X_dumy = int(X_dumy/n)
	if(out == ''): return '0'
	return out

def gcd(m,n):
	x = max(m,n)
	y = min(m,n)
	while(x%y!=0):
		z = x%y
		x = y
		y = z
	return y

class queue():
	def __init__(self):
		self.q = deque([])
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.popleft()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class stack():
	def __init__(self):
		self.q = []
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.pop()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class graph():
	def __init__(self):
		self.graph = defaultdict(list)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
		self.graph[t].append(f)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
		self.graph[t].remove(f)
	def linked(self,f):
		return self.graph[f]

class dgraph():
	def __init__(self):
		self.graph = defaultdict(set)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
	def linked(self,f):
		return self.graph[f]

main()

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

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 = input().strip().split(" ")
N = int(n)
A = int(a)
B = int(b)
if N*A < B:
    print(N*A)
else:
    print(B)