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

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

Solution (Python):
N, A, B = [int(item) for item in 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

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

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

print(min(A*N,B))

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

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

print("%d" % 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())
l=N*A
if l>B:
    print(B)
else:
    print(l)

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

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

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

Solution (Python):
import sys

def solve(n, a, b):
  return min(n * a, b)


if __name__ == "__main__":
  n, a, b = map(int, sys.stdin.readline().rstrip().split(" "))
  print solve(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(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())

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

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

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

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

cost_tr = a * n
cost_ta = b

if cost_tr <= cost_ta:
    print(cost_tr)
else:
    print(cost_ta)

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

Solution (Python):






import sys
import math


class mymath:
    
    pi = 3.14159265358979323846264338

    
    def pnum_eratosthenes(self, n):
        ptable = [0 for i in range(n+1)]
        plist = []

        for i in range(2, n+1):
            if ptable[i]==0:
                plist.append(i)
                for j in range(i+i, n+1, i):
                    ptable[j] = 1
        return plist

    
    def gcd(self, a, b):
        if b == 0:
            return a
        return self.gcd(b, a%b)

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

    
    def mul(self, A, B):
        ans = []
        for a in A:
            c = 0
            for j, row in enumerate(a):
                c += row*B[j]
            ans.append(c)
        return ans

mymath = mymath()


class output:
    
    def list(self, l):
        l = list(l)
        
        for i, num in enumerate(l):
            print(num, end="")
            if i != len(l)-1:
                print(" ", end="")
        print()

output = output()






















def get_input():
    N = []
    while True:
        try:
            N.append(input())
            
            
        except EOFError:
            break
    return N

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

x = A * N
y = B

if x < y:
    y = x

print(y)

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

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

Solution (Python):
S=[int (i) for i in input().split()]
N=S[0]
A=S[1]
B=S[2]
TRAIN=A*N
BUS=B
if TRAIN > BUS:
  print(BUS)
else:
  print(TRAIN)

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

Solution (Python):
import sys

input = sys.stdin.readline


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


if __name__ == "__main__":
    main()

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

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

Solution (Python):

from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
from functools import reduce
import sys
import math
import bisect
import random
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return list(map(float, sys.stdin.readline().split()))
def LS():return sys.stdin.readline().split()
def SR(n): return [list(sys.stdin.readline())[:-1] for i in range(n)]
def IR(n): return [int(sys.stdin.readline()) for i in range(n)]
def LIR(n): return [list(map(int, sys.stdin.readline().split())) for i in range(n)]
def LSR(n): return [list(map(list, sys.stdin.readline().split())) for i in range(n)]
_gcd = lambda x, y: _gcd(y, x%y) if (x%y) else y
_lcm = lambda x, y: x*y // _gcd(x, y)
def gcd(*numbers):
    return reduce(_gcd, numbers)
def lcm(*numbers):
    return reduce(_lcm, numbers)
sys.setrecursionlimit(1000000)
INF = float('inf')
mod = 1000000007
dire4 = [(1,0), (0,1), (-1,0), (0,-1)]
dire8 = [(1, 0), (1, 1), (0, 1), (-1, 1), (-1, 0), (-1, -1), (0, -1), (1, -1)]

N, A, B = LI()
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(n * a, b))

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

Solution (Python):
n, tr, ta = map(int, raw_input().split())

print min(n * tr, ta)

Solution (Python):


[N, A, B] = [int(i) for i in input().split()]

taxi_cost = N * A

print(min(taxi_cost, B))

Solution (Python):

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

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

print(min(N*A,B))

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

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

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

if num[0]*num[1]<num[2]:
  print(num[0]*num[1])
else:
  print(num[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('{0}'.format(min(b,n*a)))

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

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

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

ans = b if n * a > b else n * a

print(ans)

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

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

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

Solution (Python):


line = input()
ls = line.split(" ")
n = int(ls[0])
a = int(ls[1])
b = int(ls[2])

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

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

Train=A*N
Taxi=B

ans=min(Train,Taxi)
print(ans)

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

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

print(min(n*a, b))

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

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

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

elec=A*N
taxi=B

if  elec<taxi:
 print(elec)
else:
 print(taxi)

Solution (Python):
s = input()
l = s.split(" ")

n = int(l[0])
a = int(l[1])
b = int(l[2])

train = n * a
taxi = b

if(taxi < train):
    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())
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())

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

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

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

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

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

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

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

by_train = int(arg[0]) * int(arg[1])
by_taxi = int(arg[2])

if by_train > by_taxi:
  print(by_taxi)
else:
  print(by_train)

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

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

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

Solution (Python):

import sys
import math

n,a,b = [int(c) for c 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())
den=a*n
taxi=b
if den<taxi:
    print(den)
else:
    print(taxi)

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

bus = a[0] * a[1]
taxi = a[2]

min = bus if bus < taxi else taxi

print(min)

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

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

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

dm = N * A
tm = B

if tm < dm:
    print(tm)
else:
    print(dm)

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

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

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

train = N*A
taxi = B

print(min(train,taxi))

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

Solution (Python):

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

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

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

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

tac = N * A
train = B

if tac < train:
    print(tac)

else:
    print(train)

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

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

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

a =  A * N


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

Solution (Python):
import sys

readline = sys.stdin.readline

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

print(min(N * A, B))

Solution (Python):



import sys
import math
def myinput_int():
    return list(map(int, input().split()))

N,A,B = myinput_int()

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

Solution (Python):
def main(N,A,B):
  print(min(N*A,B))

if __name__ == '__main__':
  N,A,B = map(int,input().split())
  main(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 = (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 = [int(v) for v in input().split()]
print(min(n * a, b))

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

a = n * a

if a < b:
    print(a)

if a >= b:
    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,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())
train = n * a
taxi = b
l = [train, taxi]
print(min(l))

Solution (Python):

import sys
from collections.abc import Iterable
from math import *
from itertools import *
from collections import *
from functools import *
from operator import *
try:
    from math import gcd
except Exception:
    from fractions import gcd


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


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))  
    result = solve(N, A, B)
    if isinstance(result, Iterable) and not isinstance(result, str):
        result = '\n'.join([str(v) for v in result])
    print(result)

if __name__ == '__main__':
    main()

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

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

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

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

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

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):
s=input()


s = s.split(" ")


densya = int(s[0])*int(s[1])
taxi   = int( s[2] )

if ( densya < taxi):
    print(densya)
else:
    print(taxi)

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

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

print(ans)

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())  
train = n*a
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):
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(n*a) if n*a<b 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(min(A*N, B))

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

if int(inputData[0]) * int(inputData[1]) < int(inputData[2]):
  print(str(int(inputData[0]) * int(inputData[1])))
else:
  print(inputData[2])

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

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

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

Solution (Python):
def acinput():
    return list(map(int, input().split(" ")))


N,A,B=acinput()


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

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

Solution (Python):
from collections import defaultdict

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







if __name__ == '__main__':
    main()

Solution (Python):
import sys
data = sys.stdin.readlines()
data_0 = data[0].split()
data_int = [int(a) for a in data_0]

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

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

Solution (Python):
line = input()

N, A, B = map(int, line.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(A*N)

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

trainCost = N * A
taxiCost = B

if trainCost < taxiCost:
    print(trainCost)
else:
    print(taxiCost)

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

train = a*n
taxy  = b

print(min([train, taxy]))

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

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

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

sum1 = inputs[0] * inputs[1]
if sum1 < inputs[2]:
    print(sum1)
else:
    print(inputs[2])

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

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



train = n * a
taxy = b

print(min(train, taxy))

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

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

N = int(N)
A = int(A)
B = int(B)

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

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

a = N * A

if a > B:
    print(B)
else:
    print(int(a))

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

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

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

print(min(n*a,b))

Solution (Python):

import sys

import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *

readl= lambda: list(map(int, sys.stdin.readline().split()))
readt= lambda: tuple(map(int, sys.stdin.readline().split()))
read = lambda: sys.stdin.readline().rstrip()
readi = lambda: int(read())
readmi = lambda: map(int, sys.stdin.readline().split())
readms = lambda: map(str, sys.stdin.readline().split())

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

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

Solution (Python):
input_data=input().split()
ninzu = int(input_data[0])
densya = int(input_data[1])
taxi= int(input_data[2])


densya_tin = densya * ninzu

print(min(densya_tin,taxi))

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

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

Solution (Python):
s = list(map(int, input().strip().split(' ')))

a = s[0] * s[1]
b = s[2]

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

Solution (Python):

import sys


def answer(N, A, B):
    rail = N * A
    taxi = B

    print(min(rail, taxi))


if __name__ == '__main__':
    args = sys.stdin.read().split(' ')
    answer(int(args[0]), int(args[1]), int(args[2]))

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

Electric_train = int(N) * int(A)

b = int(B)

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

Solution (Python):
import bisect
import sys

verbose = False


def main():
    rv = 0
    input = sys.stdin
    args = input.readline()
    argv = args.split()
    iargv = [int(arg) for arg in argv]
    ans = min(iargv[1] * iargv[0], iargv[2])
    print(ans)


if __name__ == '__main__':
    main()

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

print(min(B,A*N))

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

Solution (Python):

import copy
import random
import bisect 
import fractions 
import math
import sys

mod = 10**9+7
sys.setrecursionlimit(mod) 

def LI(): return list(map(int, sys.stdin.readline().split()))

N,A,B = LI()

print(min(N*A, B))

Solution (Python):

import sys





"""Template"""


class IP:
    """
    入力を取得するクラス
    """
    def __init__(self):
        self.input = sys.stdin.readline

    def I(self):
        """
        1文字の取得に使います
        :return: int
        """
        return int(self.input())

    def S(self):
        """
        1文字の取得(str
        :return: str
        """
        return self.input()

    def IL(self):
        """
        1行を空白で区切りリストにします(int
        :return: リスト
        """
        return list(map(int, self.input().split()))

    def SL(self):
        """
        1行の文字列を空白区切りでリストにします
        :return: リスト
        """
        return list(map(str, self.input().split()))

    def ILS(self, n):
        """
        1列丸々取得します(int
        :param n: 行数
        :return: リスト
        """
        return [int(self.input()) for _ in range(n)]

    def SLS(self, n):
        """
        1列丸々取得します（str
        :param n: 行数
        :return: リスト
        """
        return [self.input() for _ in range(n)]

    def SILS(self, n):
        """
        Some Int LineS
        横に複数、縦にも複数
        :param n: 行数
        :return: list
        """
        return [self.IL() for _ in range(n)]

    def SSLS(self, n):
        """
        Some String LineS
        :param n: 行数
        :return: list
        """
        return [self.SL() for _ in range(n)]


class Idea:
    def __init__(self):
        pass

    def HF(self, p):
        """
        Half enumeration
        半分全列挙です
        pの要素の和の組み合わせを作ります。
        ソート、重複削除行います
        :param p: list : 元となるリスト
        :return: list : 組み合わせられた和のリスト
        """
        return sorted(set(p[i] + p[j] for i in range(len(p)) for j in range(i, len(p))))

    def Bfs2(self, a):
        """
        bit_full_search2
        bit全探索の改良版
        全探索させたら2進数のリストと10進数のリストを返す
        :return: list２つ : １個目 2進数(16桁)  2個目 10進数
        """
        
        
        
        value = []
        for i in range(1 << len(a)):
            output = []

            for j in range(len(a)):
                if self.bit_o(i, j):
                    """右からj+1番目のiが1かどうか判定"""
                    
                    output.append(a[j])
            value.append([format(i, 'b').zfill(16), sum(output)])

        value.sort(key=lambda x: x[1])
        bin = [value[k][0] for k in range(len(value))]
        val = [value[k][1] for k in range(len(value))]
        return bin, val

    def S(self, s, r=0, m=-1):
        """
        ソート関係行います。色々な設定あります。
        :param s: 元となるリスト
        :param r: reversするかどうか 0=False 1=True
        :param m: （2次元配列）何番目のインデックスのソートなのか
        :return: None
        """
        r = bool(r)
        if m == -1:
            s.sort(reverse=r)
        else:
            s.sort(reverse=r, key=lambda x: x[m])

    def bit_n(self, a, b):
        """
        bit探索で使います。0以上のときにTrue出します
        自然数だからn
        :param a: int
        :param b: int
        :return: bool
        """
        return bool((a >> b & 1) > 0)

    def bit_o(self, a, b):
        """
        bit探索で使います。1のときにTrue出すよ
        oneで1
        :param a: int
        :param b: int
        :return: bool
        """
        return bool(((a >> b) & 1) == 1)

    def ceil(self, x, y):
        """
        Round up
        小数点切り上げ割り算
        :param x: int
        :param y: int
        :return: int
        """
        return -(-x//y)

    def ave(self, a):
        """
        平均を求めます
        :param a: list
        :return: int
        """
        return sum(a) / len(a)

    def gcd(self, x, y):
        if y == 0:
            return x
        else:
            return self.gcd(y, x % y)

    def lcm(self, x, y):
        return (x * y) // self.gcd(x, y)


"""ここからメインコード"""


def main():
    
    r, e = range, enumerate
    ip = IP()
    id = Idea()

    """この下から書いてね"""
    n, a, b = ip.IL()
    if n * a >= b:
        print(b)
    else:
        print(n*a)


main()

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

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



def main():
    N,A,B = [int(x) for x in stdin.readline().split()]
    
    if N*A<B:
        print(N * A)
    else:
        print(B)

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

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

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

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

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

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

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

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

Solution (Python):
n = [int(x) for x in input().split()]
n2 = n[0] * n[1]

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

else:
  print(n2)

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

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

Solution (Python):
N, Train, Taxi = map(int, input().split(" "))

if N*Train > Taxi:
  print(Taxi)
else:
  print(N*Train)

Solution (Python):
import copy
import sys
from bisect import bisect_left, bisect_right
from collections import ChainMap, Counter, deque, defaultdict, namedtuple
from fractions import gcd
from heapq import heappop, heappush
from itertools import accumulate
from math import ceil, floor
from operator import itemgetter




def main():
    n, a, b = [int(x) for x in input().split(' ')]

    ans = min(n * a, b)

    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
input_arr = [int(x) for x in input().split()]

N = input_arr[0]
A = input_arr[1]
B = input_arr[2]

train = N*A
taxi = B

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

Solution (Python):
from enum import Enum
from queue import Queue
import collections

import sys
import math

BIG_NUM = 2000000000
MOD = 1000000007
EPS = 0.000000001

N,A,B = map(int,input().split())
min=0
if N*A < B:
    min = N*A
else:
    min = B

print(min)

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

Solution (Python):
def calc(n: int, a: int, b: int) -> int:
    train_prise = n * a
    return min(train_prise, b)


n, a, b = [int(v) for v in input().split(" ")]
print(calc(n, a, b))

Solution (Python):
import sys

str = input().split()
  
train = int(str[0]) * int(str[1])
tax = int(str[2])

if train < tax:
  print(train)
else:
  print(tax)

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

R = min(N * A, B)

print(R)

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

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

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

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