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

if __name__ == '__main__':

    ABC_133_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):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce


import sys
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = float('inf')


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

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

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

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

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


solve()

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

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

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

print(min(n * a, b))

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

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

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

Solution (Python):


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

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

Solution (Python):

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

print(min(N*A, B))

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

Solution (Python):
import sys, heapq, bisect, math, fractions
from collections import deque

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

print(min(A * N, B))

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

Solution (Python):
N, A, B = list(map(int,input().split()))
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):
import sys
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]

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

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

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

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

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

Solution (Python):
from math import ceil
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())
print(min(A*N,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=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(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())
ans = min(n*a, b)
print(ans)

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())
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
bus = b
print(min(train, bus))

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

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

print(min(n*a, b))

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

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

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


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

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

Solution (Python):


def main():
    N, A, B = map(int, open(0).read().split())

    print(min(A * N, B))


main()

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

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

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

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

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

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

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

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

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

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

t = a * n
taxi = b

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

Solution (Python):
import math
import sys
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):
import sys
from math import ceil, floor, sqrt, sin, cos, pi
from itertools import accumulate, permutations, combinations
from fractions import gcd 
from collections import deque, Counter
from operator import itemgetter
from heapq import heappop,heappush
sys.setrecursionlimit(10**7)
def lcm(x, y): return ((x * y) // gcd(x, y)) 






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

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

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

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

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

print(min(n*a,b))

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

Solution (Python):
import sys
import os
import math
import string

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: x * y / math.gcd(x, y)

MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

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


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

Solution (Python):
import math
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=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(B)
else:
  print(N*A)

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

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

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

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

Solution (Python):

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

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

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

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

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

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    

    
    

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

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())
min = a * n
for i in range(1, n+1):
    if a*(n-i)+b < min:
        min = a*(n-i)+b

print(min)

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

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

c=n*a

print(min(b,c))

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline
from itertools import permutations,  combinations, accumulate
from functools import *
from collections import deque, defaultdict, Counter
from heapq import heapify, heappop, heappush, heappushpop

INF = float('inf')
NIL = - 1

""" Input
S = input().rstrip()
N = int(input())
A = list(map(int, input().split()))
A = np.array(input().split(), dtype=np.float64)
D = [int(input()) for _ in range(N)]
AB = [[int(x) for x in input().split()] for _ in range(N)]
PX = [[int(x) for x in input().split()] for _ in range(Q)]
"""

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

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()
    ans = 2018
    if l // 2019 == r // 2019:
        for i in range(l, r + 1):
            for k in range(i+1, r + 1):
                ans = min(ans, (i * k) % 2019)
        print(ans)
    else:
        print(0)
    return


def D():
    n = II()
    a = LI()
    a = a + [a[0]]
    ans = [0] * n
    x = 0
    for i in range(1, n, 2):
        x = x + a[i + 1] - a[i]
    ans[1] = a[0] - x
    ans[0] = ans[1] + 2 * x
    for i in range(2, n):
        ans[i] = (a[i - 1] - ans[i - 1] // 2) * 2
    print(" ".join(map(str, ans)))

    return


def E():
    return


def F():
    return


def G():
    return


def H():
    return


if __name__ == '__main__':
    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())
x = N * A
y = B

print(min((x),(y)))

Solution (Python):

"""
Created on Sun Apr 19 20:41:42 2020

@author: Kanaru Sato
"""

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

train = n*a
taxi = b

print(min(train,taxi))

Solution (Python):

a, b, c = map(int, input().split())
N = a * b

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

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

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

print(min(a * n, b))

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 6)

def main():
    N, A, B = map(int, sys.stdin.readline().rstrip().split())
    print(min(B, A*N))


if __name__ == '__main__':
    main()

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

Solution (Python):
number, train, taxi = map(int, input().split())

print(min([train*number, taxi]))

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

buss = N*A
taxi = B

print(min(buss,taxi))

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

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

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

Solution (Python):

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

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

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

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

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

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

tr = N * A
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 = input().split()

n = int(n)
a = int(a)
b = int(b)

if a*n >= b:
    print(b)
elif a*n < b:
    print(a*n)

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

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

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

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

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

print(min(N*A, B))

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

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

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

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

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

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

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

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

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

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

Solution (Python):
import sys


def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())

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

def LLI(rows_number): return [LI() for _ in range(rows_number)]

p2D = lambda x: print(*x, sep="\n")


n,a,b=MI()


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

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

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

print(min(n*a,b))

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

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

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

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

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

print(min(b,a*n))

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

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

print(min(A*N, B))

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

print(min(x))
'''
for i in x:
    if x[i] < x [i + 1]:
        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, m, k = map(int, input().split())
if n * m >= k:
    print(k)
else :
    print(n * m)

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

tr = n*a
tx = b

if tr>=tx:
    print(tx)
else:
    print(tr)

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

    
if __name__ == '__main__':
    q1()

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

train = A * N
taxi = B
amount = min(train, taxi)

print(amount)

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

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

Solution (Python):
def main():

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

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

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

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

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

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

Solution (Python):

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

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

else:
  print(N*A)

Solution (Python):
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect




from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')

def main():
  n, a, b = map(int, readline().split())
  print(min(n*a,b))
  
  
  
  
  
if __name__ == '__main__':
  main()

Solution (Python):
a,b,c= input().split()
x,y,z=(int(a),int(b),int(c))
total_train = x*y
total_taxi=z
print(min([total_train, total_taxi]))

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

print(min(tra, b))

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