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(' '))
price = []
res = B if B <= A *N else A*N
print(res)

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

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

print(min(N * A, B))

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



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

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

f_train = s[0]*s[1]
f_taxi = s[2]

if f_train <= f_taxi:
    print(f_train)
else:
    print(f_taxi)

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

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

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

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

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

print(min(N*A, B))

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

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

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

Solution (Python):


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

print(min(b, a*n))

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

train = a * n

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

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

train = N * A
taxi = B

print(min(train,taxi))

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

train = n*a
tax = b

if train > tax:
	print(tax)
	exit()
print(train)

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

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

Solution (Python):

from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')


def A():
    n, a, b = LI()
    print(min(n * a, b))
    return


def B():
    n, d = LI()
    x = LIR(n)
    a = list(itertools.combinations(range(n), 2))
    ans = 0
    for a1,a2 in a:
        b = 0
        for bi in range(d):
            b += (x[a1][bi] - x[a2][bi])** 2
        if float.is_integer(math.sqrt(b)):
            ans += 1
    print(ans)
    return


def C():
    l, r = LI()
    if l // 2019 == r // 2019:
        print((l * (l + 1)) % 2019)
    else:
        print(0)
    return


def D():
    return


def E():
    return


def F():
    return


def G():
    return


def H():
    return


if __name__ == '__main__':
    A()

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

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

print(min(a*n, b))

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

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

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

Solution (Python):


def read_input():
    n, a, b = map(int, input().split())
    return n, a, b


def submit():
    n, a, b = read_input()

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


if __name__ == '__main__':
    submit()

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

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

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

if (x<y):
  print(x)
else:
  print(y)

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

total = min([a * n, b])

print(total)

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

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

Solution (Python):



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

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

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

s = N * a

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

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

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

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

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

Solution (Python):
import sys 
import numpy as np 

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

TorT()

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

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

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

train=int(N)*int(A)

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

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

print(min(a*n,b))

Solution (Python):
n, a, b = [ int(_) for _ in input().split() ]
train = a * n
taxi = b
ans = min(train, taxi)
if ans == train:
    print(train)
else:
    print(taxi)

Solution (Python):





def main():

   in0 = input()

   IN = in0.split(' ')

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

   train = N*A
   taxi = B

   if(train<taxi):
      print ("%s" % (train))
   else:
      print ("%s" % (taxi))
      



if __name__ == "__main__":
   main()

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

Solution (Python):
import numpy as np


i = list(map(int, input().split()))

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


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

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

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

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

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

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

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

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

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

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

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

print(min(n*a, b))

Solution (Python):
a = input()
l = a.split()

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

Solution (Python):
n, t, ta = list(map(int, input().split()))

t *= n

if t <= ta:
    print(t)

else:
    print(ta)

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

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

Solution (Python):
numbers = input().split()
if(int(numbers[0])*int(numbers[1]) < int(numbers[2])):
  ans = int(numbers[0])*int(numbers[1]) 
else:
  ans = int(numbers[2])
 
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())

print(min(b, n*a))

Solution (Python):



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

if B >= t:
    print(t)
else:
    print(B)

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

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

Solution (Python):
Num, Train_money, Taxy_Sum_Money = (int(i) for i in input().split())
Train_Sum_Money = Num * Train_money
print(min(Train_Sum_Money, Taxy_Sum_Money))

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


if __name__ == '__main__':
    main()

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

Solution (Python):
n,a,b = list(map(int,input().split()))
afee = n * a
bfee = b
flist = [afee, bfee]
flist.sort()
print(flist[0])

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

x=min([N*A,B])

print(x)

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

train = A*N
taxi  = B

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

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

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

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

Solution (Python):

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


print("{}".format(b if n*a > b else n*a))

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

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

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

t *= n

if t <= ta:
    print(t)

else:
    print(ta)

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

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

TorT()

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

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


if __name__ == "__main__":
    main()

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

Solution (Python):
import functools as ft
import heapq
import itertools as it
import logging
import unittest
from collections import (
    OrderedDict,
    defaultdict,
    namedtuple,
    Counter,
)

import numpy as np

_ = [ft, it, np, heapq, namedtuple, Counter, defaultdict, OrderedDict]

debug = logging.getLogger(__name__).debug


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


def _main():
    n, a, b = input_ints()
    train_rate = a
    taxi_rate = b / n
    if train_rate < taxi_rate:
        print(a * n)
    else:
        print(b)


class Test(unittest.TestCase):
    def setUp(self):
        import run
        self._test = run

    def test_main(self):
        self._test.test_files(self, _main)


if __name__ == '__main__':
    _main()

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

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

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

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

ans = min([b,n*a])

print(ans)

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

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

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

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

Solution (Python):
import sys

for line in sys.stdin:
  N, A, B = map(int, line.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( a*n < b ):
    print(a*n)
else:
    print(b)

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

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

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

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

bus_fare = N * A

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

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

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

Solution (Python):

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

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

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

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

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

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

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

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

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

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

Solution (Python):
import sys


def main():
    N, A, B = [int(s) for s in sys.stdin.readline().strip().split()]
    print(min(A * N, B))


if __name__ == '__main__':
    main()

Solution (Python):
   
if __name__ == '__main__':
    n,a,b  = list(map(int, input().split(" ")))
  
    result = 0
    if a*n > b:
        result = b
    else:
        result = a*n
   
    print(result)

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

ans = p[0] * p[1] if p[0] * p[1] < p[2] else p[2]

print(ans)

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

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

C = N*A

print(min(B, C))

Solution (Python):
import os, sys, re, math

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

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

Solution (Python):


from collections import deque
import itertools as ite
import sys
import math

sys.setrecursionlimit(1000000)

INF = 10 ** 18
MOD = 10 ** 9 + 7

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

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

Tr = A * N
Tx = B

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

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

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

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(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):
A=[int(i) for i in input().split()]
n=A[0]
a=A[1]
b=A[2]
c=n*a

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

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

D = N * A

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

Solution (Python):



from sys import stdin


N,A,B = [int(x) for x in stdin.readline().rstrip().split()]

total_train = N * A
total_tac = B

if total_train <= total_tac:
    print(total_train)
else:
    print(total_tac)

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

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

print(min(n*a, b))

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

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

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

    Train = A * N
    Taxi = B

    if Train < Taxi:
        print(Train)
    else:
        print(Taxi)

    return


if __name__ == "__main__":
    main()

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

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

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

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

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

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

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

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

train = A*N
taxy = B

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

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

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

x = n*a

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

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

train_fee = N * A
taxi_fee = B

if train_fee >= taxi_fee:
  print(taxi_fee)
else:
  print(train_fee)

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

train = n * a
taxi = b

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

Solution (Python):
mini=10000
N,A,B=(int(x) for x in input().split())
a=min(A*N,B)
print(a)

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

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

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

train = A * N
tax = B

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

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

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

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

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

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

print(min(b, a*n))

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

Solution (Python):



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

cost_train = N*A
cost_taxi = B

if cost_train <= cost_taxi:
    print(cost_train)
else:
    print(cost_taxi)

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

Solution (Python):
N, A, B = map(int, input().split())
sum_train = N * A
sum_taxi = B
if sum_train < sum_taxi:
    print("{}".format(sum_train))
else:
    print("{}".format(sum_taxi))

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

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

train = A*N
taxi  = B

print(int(min(train, taxi)))

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

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

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

main()

Solution (Python):
a = input()

a = a.split()
lista = [int(i) for i in a]

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

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

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

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


def solve(N, A, B):
    if N * A < B:
        return N * A
    else:
        return B


if __name__ == '__main__':
    inputs = read()
    print("%d" % solve(*inputs))

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

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

Solution (Python):

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

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

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

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

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

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

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

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(100000)

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

n,a,b=intinput()
print(n*a if n*a<b else b)

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

de = N * A
ta = B

if de >= ta:
    print(ta)
else:
    print(de)

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

Solution (Python):
_input = [i for i in open(0).read().split('\n') if i]
n, a, b = [int(i) for i in _input[0].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):
if __name__ == '__main__':
    n, a, b = map(int, input().split())
    x = n * a
    if x <= b:
        print(x)
    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_cost = N * A
taxi_cost = B

if train_cost < taxi_cost:
    print(train_cost)
else:
    print(taxi_cost)

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

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

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

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

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

N, A, B = str.split(" ")

a = int(N) * int(A)
b = int(B)

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

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

if N*A > B:
    result = B
else:
    result = N*A

print(result)

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

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

print(min(n*a,b))

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

tmp = N * A

print(min(tmp,B))

Solution (Python):
n, train_yen, taxi_yen = map(int, input().split())

if n * train_yen < taxi_yen:
    print(n * train_yen)
else:
    print(taxi_yen)

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):
import numpy as np
from sys import stdin

A,B,C=[int(x) for x in stdin.readline().rstrip().split()]

print(min(A*B,C),flush=True)

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

Solution (Python):

import sys


def solve(N: int, A: int, B: int):
    train = N * A
    taxi = B

    if train < taxi:
        print(train)
    elif train == taxi:
        print(train)
    else:
        print(taxi)

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

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

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

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

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

sum = 0

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

print(sum)

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

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

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

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

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