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

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

Solution (Python):
from sys import stdin

input = [int(x) for x in stdin.readline().rstrip().split()]

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

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

Solution (Python):

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

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

if __name__ == "__main__":
    solve()

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

densya = a*b

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

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

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

print(ans)

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

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

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

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

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

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

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

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

(print(n * a) if a * n < 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):
from sys import exit

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

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

Solution (Python):
import numpy as np

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

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

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

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

Solution (Python):
sen = input()

x = sen.split()

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

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

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

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

Solution (Python):


"""
Created on Sun Jul  7 20:52:12 2019

@author: YudNK
"""

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

train = A * N
taxi = B

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

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

train = int(input[0])*int(input[1])
taxy = int(input[2])

print(min(train,taxy))

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

moneyA = N*A
moneyB = B

if moneyA<moneyB:
    print(moneyA)
else:
    print(moneyB)

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

Train = A * N

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

Solution (Python):


import sys

debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]


    token = lines[0].split()
    n = int(token[0])
    a = int(token[1])
    b = int(token[2])

    return (n, a, b)


def solve(n, a, b):

    return min(n*a, b)




def main():
    

    print("%s" % solve(*parse_input()))

if __name__ == '__main__':

    main()

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

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

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

Solution (Python):
x, y, z = input().split()
N = int(x)
A = int(y)
B = int(z)

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

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

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

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

print(min(b,a*n))

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

print(min(A*N, B))

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

train = n * a 

ans = train

if train > b :
    ans = b


print(ans)

Solution (Python):

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

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

train = N*A
taxi = B

print(min(train, taxi))

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

Solution (Python):
import sys

n, a, b = [ int(x) for x in sys.stdin.readline().split() ]

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

Solution (Python):
def TorT(N: int, A: int, B: int)->int:
    return min(A*N, B)


if __name__ == "__main__":
    N, A, B = map(int, input().split())
    ans = TorT(N, A, B)
    print(ans)

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

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

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

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

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

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


if __name__ == '__main__':
	main()

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

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

Solution (Python):
from sys import stdin

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

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

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

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

Solution (Python):

import sys;
import string;
sys.setrecursionlimit(20000) 

import copy
import itertools

from functools import lru_cache


PPP = 1000000007






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

























import re
import fractions

def lcm(x, y):
    return (x * y) // fractions.gcd(x, y)
  
def count(c):
  r = b // c - (a - 1) // c;
  print(c, r, file=sys.stderr)
  return r

def doit():
  res = min(n * a, b)
  
  return res




try:
  print(doit())
except Exception as e:
  print("e", e, file=sys.stderr)

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(4100000)
import math

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

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(' '))
    na = n * a
    print(min([na, b]))


if __name__ == '__main__':
    main()

Solution (Python):


tmp = input().split()
hoge = list(map(lambda a: int(a), tmp))
n=hoge[0]
a=hoge[1]
b=hoge[2]

print(min(n*a,b))

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

print(min(a*n, b))

Solution (Python):


import math
import sys
import itertools
import numpy as np


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

print(min(b,a*n))

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

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

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

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

print(min(N * A, B))

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

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

Solution (Python):

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


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


def main():
    n, a, b = input_from_console()
    print(solve(n, a, b))


if __name__ == "__main__":
    import sys

    if sys.gettrace():  
        check_cases()
    else:
        main()

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

print(min(a*n,b))

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

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

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

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

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

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

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

Solution (Python):
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())
Train=N*A
Taxi=B
print(min([Train,Taxi]))

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

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

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

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

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

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

Solution (Python):


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

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

Solution (Python):



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


if __name__ == '__main__':

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

    ans = solv(n, a, b)

    print(ans)

Solution (Python):
s = input().rstrip().split(' ')

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

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

Solution (Python):
from sys import stdin
N,A,B = [int(x) for x in stdin.readline().rstrip().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(' '))
res1 = n * a
res2 = b
if res1 > res2:
    print(res2)
else:
    print(res1)

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

Solution (Python):
N, A, B = (int(x) for x in 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(c)
else:
  print(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("{}".format(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):
price = list(map(int, input().rstrip().split()))
print(min(price[0]*price[1], price[2]))

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

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

print(min(n*a,b))

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

Solution (Python):
from sys import stdin


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


if __name__ == "__main__":
    main()

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

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

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

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

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

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

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

print(min(a * n, b))

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

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

Solution (Python):

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

result = min(A*N, B)

print(result)

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

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

to = a*n

if to < b:
    print(to)

else:
    print(b)

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


BC133_A()

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

tr = a * n
tx = b

if tr < tx:
    print(tr)
else:
    print(tx)

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

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

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

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

print(min(N*A,B))

Solution (Python):

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

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

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

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


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

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 = 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 sys import stdin

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

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

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

print(min([N*A,B]))

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

Solution (Python):
"""


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


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


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


char_list = list("abcd") 
"""

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

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

mod = 1000000007

if __name__ == "__main__":
    N,A,B= map(int, sys.stdin.readline().split())
    d=N*A
    t=B
    if d>t:
        ans=t
    else:
        ans=d
    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 = list(map(int,input().split()))

densha = n*a
takushi = b

print(str(min(densha,takushi)))

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

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

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

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

ans = min(A*N, B)

print(ans)

Solution (Python):


from fractions import gcd
from math import ceil,floor
import collections







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):
import sys
stdin = sys.stdin

sys.setrecursionlimit(10 ** 7)

def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x) - 1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())


n, a, b = li()

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

Solution (Python):
S=input()

tmp=S.split()

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

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

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

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

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('{}'.format(min(N*A,B)))

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

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

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

Solution (Python):



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

print(min(n*a, b))

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

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

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

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

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

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

x = a[0]*a[1]

if x>a[2]:
  print(a[2])
else:
  print(x)

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

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

print(min(N*A,B))

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

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

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



print(min([b,n*a]))

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

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

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

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


train = A * N
taxi = B

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

Solution (Python):


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

p = []
p.append(N*A)
p.append(B)

print(min(p))

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

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

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

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

Solution (Python):
n, a, b = 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):
from sys import stdin
 

N, A, B = [int(x) for x in stdin.readline().rstrip().split()]
 
cost = N * A
if cost > B:
    cost = B
    
print(cost)

Solution (Python):
import sys

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

train = N * A
taxi = B

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

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

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

Solution (Python):
import sys
                                                                                                    
def main():
    input = sys.stdin.readline
    N, A, B = map(int, input().split())
    return min(A*N, B) 
    
     
if __name__ == '__main__':
    print(main())

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

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

print(min(a*n, b))

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

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

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

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

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

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

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

print(min(n*a,b))

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

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

a1 = n*a
b1 = b

if a1>=b1:
    out = b1
else:
    out = a1

print(out)

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

print(min(n*a,b))

Solution (Python):
import sys,heapq
from collections import deque,defaultdict
printn = lambda x: sys.stdout.write(x)
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
DBG = True 
def ddprint(x):
  if DBG:
    print(x)

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

Solution (Python):
N, A, B = list(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())
train = N*A
taxi = B
if train<taxi:
  print(train)
else:
  print(taxi)

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

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

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

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

Solution (Python):

import sys
input = sys.stdin.readline


sys.setrecursionlimit(10**6)

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

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

print(min(n*a,b))

Solution (Python):

from collections import defaultdict, deque
import math
from math import factorial
import re

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

    price = A_price if A_price < B_price else B_price
    print(price)


if __name__ == '__main__':
    main()

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

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

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

if __name__ == '__main__':
    main()

Solution (Python):
import numpy as np

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

if a_ <= b:
    print(a_)
else:
    print(b)

Solution (Python):
import sys
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
ra = lambda: list(map(int, sys.stdin.readline().split()))

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

Solution (Python):
import sys

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

taxi = B/N

if A < taxi:
    ans = A * N
else:
    ans = B

print(ans)

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

print(min(N*A, B))

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

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

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


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

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

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

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

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

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

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

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

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

print(min(n*a, b))

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

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

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

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

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