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

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

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):
x = list(map(int,input().split()))
tr = x[0]*x[1]
ta = x[2]
print(min(tr,ta))

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 = N*A
taxi = B

print(min(train, taxi))

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

print(min(N*A, B))

Solution (Python):
def slove():
    import sys
    input = sys.stdin.readline
    n ,a, b = list(map(int, input().rstrip('\n').split()))
    print(min(n * a, b))


if __name__ == '__main__':
    slove()

Solution (Python):

lst = [int(x) for x in input().split()]
train = lst[0] * lst[1]
taxi = lst[2]
print(min(train, taxi))

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

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

t=n*a

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

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

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

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


train = N * A

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

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

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

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

Solution (Python):
def main():
    n, a, b = map(int, open(0).read().split())

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

if __name__ == '__main__':
    main()

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

Solution (Python):



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


if __name__ == '__main__':
    main()

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

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

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

print(min(a * n, b))

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

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

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):
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):
lis_base = list(map(int,input().split()))
N = lis_base[0]
A = lis_base[1]
B = lis_base[2]

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

d = A * B
t = 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):
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
print(b if train >= b else 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())
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())

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())
tr=n*a
ans=min(tr,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())

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

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

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

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

print(min(n*a,b))

Solution (Python):

import sys


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

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

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

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

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

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

x = N*A
y = B

print(min(x, y))

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

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

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

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

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):
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
cost=min(train,taxi)
print(cost)

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


if __name__ == "__main__":
    main()

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

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

print(min(n*a, b))

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

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

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

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

print(min(N * A, B))

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

print(min(N*A, B))

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

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

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

Solution (Python):
i,j,k=map(int,input().split())
if i*j<=k:
  print(i*j)
else:
  print(k)

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

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

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

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

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

print( min(N*A, B) )

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

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

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

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

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

print(min(n*a,b))

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

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

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

Solution (Python):
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
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 = 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=map(int, input().split())
if a*n > b:
  print(b)
else:
  print(a*n)

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

Solution (Python):
from sys import stdin
li = list(map(int,stdin.readline().rstrip().split()))
if li[1]*li[0] > li[2]:
    print(li[2])
else:
    print(li[0]*li[1])

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

print(min(N*A,B))

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

Solution (Python):
n,m,l = input().split()
n = int(n)
m = int(m)
l = int(l)

print(min(n*m,l))

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

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

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

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

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

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

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

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

c = n * a

if c >= b:
    print(b)
else:
    print(c)

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

Solution (Python):
array = input().split()
array = tuple(array)

count = int(array[0])
train_fare = int(array[1])
taxi_fare = int(array[2])

total_train_fare = train_fare * count


if (total_train_fare <= taxi_fare):
    print(total_train_fare)
else:
    print(taxi_fare)

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

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

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

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

if __name__ == '__main__':
    main()

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

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

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

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

N *= A

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

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

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

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

print(min(n * a, b))

Solution (Python):
from sys import exit, stderr, stdin
input = stdin.readline
def debug(var, name="hoge"):
    print(name +":" + str(type(var)) + " = " + repr(var), file=stderr)
    return


def main():
    N,A, B = [int(n) for n in input().split()]
    print(min(A*N, B))
    
    
    
    
    
    
    
    



if __name__ == "__main__":
    main()

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

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

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

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

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

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 = 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())
ans = 0
if n * a > b:
  ans = b
else:
  ans = n * a
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(int(N*A),B))

Solution (Python):
import sys
from math import ceil
from operator import itemgetter as get

def input():
    return sys.stdin.readline().strip()

def iinput():
    return int(input())

def finput():
    return float(input())

def tinput():
    return input().split()

def rinput():
    return map(int, tinput())

def rlinput():
    return list(rinput())

def nod(a, b):
    while b: 
        a, b = b, a % b
    return a
 
def calc(n, c, d):
    return n - n // c - n // d + n // (c * d // nod(c, d))   


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

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

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

Solution (Python):
def slove():
    import sys
    input = sys.stdin.readline
    n, a, b = list(map(int, input().rstrip('\n').split()))
    print(min(a * n, b))


if __name__ == '__main__':
    slove()

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

print(min(b, n*a))

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]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


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


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



def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2



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



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


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


if __name__ == '__main__':
    main()

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

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())
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()))
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())
taxi = int(N*A)

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

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

Solution (Python):
import sys
input = sys.stdin.readline
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 = map(int, input().split())

ans = min(A*N, B)

print(ans)

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

Solution (Python):
n,a,b = map(int,input().split())
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=input().split(" ")
cost=[]
cost.append(int(n)*int(a))
cost.append(int(b))
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(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())

t = n * a

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

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

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

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

if N*A>B:
    sum=B

else:
    sum=N*A

print(sum)

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

if __name__ == "__main__":
    f_a()

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

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

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

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

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

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

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

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

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

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

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

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

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

w1 = a*n

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

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

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

Solution (Python):

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

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

d = n * a
t = b

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

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

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

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

Solution (Python):
a=input().split(" ")
N=int(a[0])
A=int(a[1])
B=int(a[2])
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=map(int,input().split())
print(min(N*A,B))

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

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

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

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

if A * N > B:
    print(B)

else:
    print(A * N)

Solution (Python):
l = map(int, raw_input().split())

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

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

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

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

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

print(min(n * a, b))

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
readints=lambda:map(int,input().split(' '))
n,a,b=readints()
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 1 <= n <= 20 and 1 <= a <= 50 and 1 <= b <= 50:
    print(min(n * a, b))
else:
    print('Invalid value')

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

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

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

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

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

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

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

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