Problem:


Score : 100 points

Problem Statement

You are parking at a parking lot. You can choose from the following two fee plans:

Plan 1: The fee will be A×T yen (the currency of Japan) when you park for T hours.

Plan 2: The fee will be B yen, regardless of the duration.

Find the minimum fee when you park for N hours.

Constraints

1≤N≤20

1≤A≤100

1≤B≤2000

All input values are integers.

Input

Input is given from Standard Input in the following format:

N A B

Output

When the minimum fee is x yen, print the value of x.

Sample Input 1

7 17 120

Sample Output 1

119

If you choose Plan 1, the fee will be 7×17=119 yen.

If you choose Plan 2, the fee will be 120 yen.

Thus, the minimum fee is 119 yen.

Sample Input 2

5 20 100

Sample Output 2

100

The fee might be the same in the two plans.

Sample Input 3

6 18 100

Sample Output 3

100



Sample input:
7 17 120


Sample output:
119

Submission status: Accepted

Solution code:
def smaller(x, y):
	if x < y: return x
	else: return y

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,a,b = map(int, input().split());print([n*a,b][n*a>b])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

p1 = n * a
p2 = b

if p2 < p1:
    print(p2)
else:
    print(p1)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x,y,z=map(int,input().split())
print(min(x*y,z))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
X,A,B=map(int,input().split())
list=[X*A,B]
print(min(list))

Submission status: Accepted

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

print(min(N*A,B))

Submission status: Accepted

Solution code:
# coding: utf-8
n, a, b = map(int, input().split())
if n * a < b:
    print(n * a)
else:
    print(b)

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().strip()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import sys

def getinputdata():

    # 配列初期化
    array_result = []
    
    data = input()

    
    array_result.append(data.split(" "))

    flg = 1

    try:


        while flg:

            data = input()

            array_temp = []

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = 1

            else:

                flg = 0
    finally:


        return array_result





arr_data = getinputdata()

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input().split()
N = int(x[0])
A = int(x[1])
B = int(x[2])
a = N * A
if a >= B :
    print (B)
if a < B :
    print (a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

# AtCoder Beginner Contest
# Problem A

if __name__ == '__main__':
    N_hour, A, B = list(map(int, input().split()))

    result = min(N_hour * A, B)
    print(result)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(min(n*a, b))

Submission status: Accepted

Solution code:
#-*- coding: utf-8 -*-
N, A, B = map(int, input().split())
print(N*A if N*A < B else B)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
price =input().split()
if int(price[0]) *  int(price[1]) > int(price[2]) :
	print(int(price[2]))
else :
	print(int(price[0]) * int(price[1]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import collections
import itertools
import array
import inspect

# Set max recursion limit
sys.setrecursionlimit(10000)

# Debug output
def chkprint(*args):
    names = {id(v):k for k,v in inspect.currentframe().f_back.f_locals.items()}
    print(', '.join(names.get(id(arg),'???')+' = '+repr(arg) for arg in args))

# Binary converter
def to_bin(x):
    return bin(x)[2:]

# Set 2 dimension list
def dim2input(N):
    li = []
    for _ in range(N):
        li.append(list(map(int, input())))
    return li

# --------------------------------------------

dp = None

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

    print(min(N*A, B))

main()

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
n, a, b = map(int, input().rstrip().split())
if n * a < b:
    print(n * a)
else:
    print(b)

Submission status: Accepted

Solution code:
# coding: utf-8
n, a, b = list(map(int, input().split()))
print(min([a*n, b]))

Submission status: Accepted

Solution code:
import math
g = list(map(int, input().split()))
p1 = g[1] * g[0]
p2 = g[2]
print(min(p1, p2))

Submission status: Accepted

Solution code:
x = str(input()).split(" ")

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

plan1 = n*a
plan2 = b

if plan1 >= plan2:
	print(plan2)
else:
	print(plan1)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, a, b = [int(x) for x in raw_input().split()]
print min(n * a, b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

import sys

n, a, b = [int(e) for e in raw_input().split()]
# print n, a, b
# print n*a, b
# print min(n*a, b)

sys.stdout.write('%d\n' % ( min(n*a, b) ))
sys.stdout.flush()

Submission status: Accepted

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

Submission status: Accepted

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

print(min(N * A, B))

Submission status: Accepted

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

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

else :
    print(N*A)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-



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

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

if __name__ == "__main__": main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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


if __name__ == "__main__":
    n, a, b = list(map(int, input().split()))
    print(foo(n, a, b))

Submission status: Accepted

Solution code:
import math

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num = input()
sp = num.split()
T = int(sp[0])
A = int(sp[1])
B = int(sp[2])

plan1 = A * T
plan2 = B

if plan1 < plan2:
    print(plan1)
else:
    print(plan2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A - Parking

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

print min(N*A, B)

Submission status: Accepted

Solution code:
T,A,B=map(int,input().split())

print(min(T*A, B))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
t = sys.stdin.readline()

t1 = t.rstrip()

t2 = t1.split(' ')

T = int(t2[0])
A = int(t2[1])
B = int(t2[2])
p1 = A*T

if B < p1:
    print(B)
elif B > p1:
    print(p1)
else:
    print(B)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
n, a, b = map(int, sys.stdin.readline().split())
p1 = n * a
p2 = b

print(min(p1,p2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

print(min(A*N, B))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,a,b = list(map(lambda x: int(x),input().split()))

price_1 = n*a
price_2 = b

if price_1 > price_2:
    print(price_2)
else:
    print(price_1)

Submission status: Accepted

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

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

print(S)

Submission status: Accepted

Solution code:
a = [int(i) for i in input().split()]
b = []
b.append(a[0]*a[1])
b.append(a[2])

print(min(b))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
https://beta.atcoder.jp/contests/abc080/tasks/abc080_a

"""
import sys
from sys import stdin

input = stdin.readline


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


if __name__ == '__main__':
    main(sys.argv[1:])

Submission status: Accepted

Solution code:
a,b,c = map(int, raw_input().strip().split())
print min([a*b,c])

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

# 出力
if n * a < b:
    print(n*a)
else:
    print(b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
n, a, b = map(int, input().split())
result = min(a * n, b)
print(result)

Submission status: Accepted

Solution code:
#標準入力はN,A,Bで与えられる
numbers =input().split()

for  i in range(len(numbers)):
    numbers[i] = int(numbers[i])

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

Submission status: Accepted

Solution code:
print (lambda t,a,b: t*a if t*a<b else b)(*map(int, raw_input().split()))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=(int(i)for i in input().split())
d=a*b
if d>c:
    print(c)
else:
    print(d)

Submission status: Accepted

Solution code:
#AtcoderABC003 #4
N,A,B=input().split(' ')
N,A,B=[int(N),int(A),int(B)]

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N, A, B = map(int, input().split())

plan1 = N * A
plan2 = B

if plan1 < plan2:
    print(plan1)
else:
    print(plan2)

Submission status: Accepted

Solution code:
def plan_one(time, price_base):
    price = time * price_base
    return price

if __name__ == "__main__":
    input_list = input().split(" ")
    N, A, B = int(input_list[0]), int(input_list[1]), int(input_list[2])
    price = min(plan_one(N, A), B)
    print(price)

Submission status: Accepted

Solution code:
#coding: UTF-8

input = input().split()

A = int(input[1])*int(input[0])

if A > int(input[2]):
    print(input[2])
else:
    print(A)

Submission status: Accepted

Solution code:
import sys

line = sys.stdin.readline()
n, a, b = [int(x) for x in line.rstrip().split(' ')]
if n * a <= b:
    print(n * a)
else:
    print(b)

Submission status: Accepted

Solution code:
# coding:utf-8                                                                         

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

pl1_price = A * N
pl2_price = B

if pl1_price > pl2_price:
    print pl2_price
else:
    print pl1_price

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(min(n*a,b))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**15
mod = 10**9+7

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)


def main():
    n,a,b = LI()

    return min(n*a,b)



print(main())

Submission status: Accepted

Solution code:
# -*- coding:utf-8 -*-
n, a, b = map(int ,input().split())
if a*n >= b:
    print(b)
else:
    print(a*n)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Wed Oct 18 17:04:29 2017

@author: goto
"""

int1,int2,int3=map(int, input().split())

t=int1*int2

if t<int3:
    minmoji=t
else:
    minmoji=int3
    

print(minmoji)

Submission status: Accepted

Solution code:
list = input().rstrip().split()

if int(list[0])*int(list[1])>=int(list[2]):
    print(list[2])
else:
    print(str(int(list[0])*int(list[1])))

Submission status: Accepted

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

Submission status: Accepted

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

def main():
    ans = min(N * A, B)
    print(ans)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N,A,B = [int(val) for val in raw_input().split(" ")]

print min(N*A, B)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# 整数の入力
n, a, b = [int(i) for i in input().split()]
# 計算
def main():
    if a * n < b:
        print(a * n)
    else:
        print(b)

# 実行
main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input().split()
N=int(a[0])
A=int(a[1])
B=int(a[2])
if(N*A<=B):
  print(N*A)
else:
  print(B)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

def main():
    t, a, b = map(int, raw_input().split())
    a_ans = a * t
    print a_ans if a_ans < b else b

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt, ceil, floor
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
INF = float("inf")
sys.setrecursionlimit(10**7)

# 4近傍（右, 下, 左, 上）
dy = [0, -1, 0, 1]
dx = [1, 0, -1, 0]


def inside(y: int, x: int, H: int, W: int) -> bool: return 0 <= y < H and 0 <= x < W


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

res=min(N*A,B)

print(res)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    N, A, B = map(int, input().split())

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

cost = min(N * A, B)

print(cost)

Submission status: Accepted

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

cost = B

if(N*A < B):
    cost = N*A

print(cost)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, a, b = map(int, raw_input().split())

print min(b, a * n)

Submission status: Accepted

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

v_fee = N*A
f_fee = B
 
data = [v_fee , f_fee]
dmin = min(data)
 
print(dmin)

Submission status: Accepted

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

print(min(n*a, b))

Submission status: Accepted

Solution code:
aaa = [int(x) for x in input().split(' ')]
n = aaa[0]
a = aaa[1]
b = aaa[2]
print(min(n * a, b))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N, A, B = map(int, input().split())
if A * N < B:
    x = A*N
else:
    x = B
print(x)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
n = list(map(int, input().split()))
planA = n[0]*n[1]
planB = n[2]

if planA<=planB:
    print(planA)
else:
    print(planB)

Submission status: Accepted

Solution code:
# coding: utf-8

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

Submission status: Accepted

Solution code:
#!/user/bin/python
# coding: UTF-8

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

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

Submission status: Accepted

Solution code:
N,A,B= input().strip().split(' ')
N,A,B = [int(N),int(A),int(B)]
plan1 = A*N
plan2 = B
print(min(plan1,plan2))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N, A, B = input().split()
'''                                                                                                                                     
N = input()                                                                                                                             
A = input()                                                                                                                             
B = input()                                                                                                                             
'''
N = int(N)
A = int(A)
B = int(B)
priceA = A * N
if  priceA <= B:
    print(priceA)
else:
    print(B)

Submission status: Accepted

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

plan_1 = int(N) * int(A)
plan_2 = int(B)

if plan_1 > plan_2:
    print(plan_2)
else:
    print(plan_1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = list(map(int,input().split()))

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

Submission status: Accepted

Solution code:

input_line = input().rstrip().split(' ')

planA = int(input_line[0]) * int(input_line[1])
planB = int(input_line[2])

print(min(planA, planB))

Submission status: Accepted

Solution code:
def solve():
    N, A, B = map(int, input().split())
    s1 = N * A

    if s1 > B:
        ans = B
    else:
        ans = s1

    print(ans)

if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
a,b,c = map(int,raw_input().split())
lis = []
lis.append(a*b)
lis.append(c)
print min(lis)

Submission status: Accepted

Solution code:
s = input()
n_str, a_str, b_str = s.split()
n = int(n_str)
a = int(a_str)
b = int(b_str)
ans_a = a * n
if ans_a <= b:
    print(ans_a)
elif b < ans_a:
    print(b)

Submission status: Accepted

Solution code:
l = map(int,raw_input().split())
print min(l[0]*l[1],l[2])

Submission status: Accepted

Solution code:
import sys
n, a, b = [int(x) for x in input().split()]
print(min(a*n, b))

Submission status: Accepted

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

Submission status: Accepted

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

print(min(N*A, B))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
n,a,b = map(int,stdin.readline().split())
print min(n*a,b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding:utf-8
n, a, b = map(int, input().split())
print(min([n*a, b]))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

DBG_FLAG = 0

def p_dbg(str):
    if(DBG_FLAG == 1):
        sys.stdout.flush()
        print str

[N, A, B] =  map(int,raw_input().split())

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

Submission status: Accepted

Solution code:
N,A,B = [int(i) for i in input().split()]
plan1 = N*A
plan2 = B
if plan1 > plan2:
    print(plan2)
else:
    print(plan1)

Submission status: Accepted

Solution code:
import sys
def LI(): return [int(x) for x in sys.stdin.readline().split()]

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

Submission status: Accepted

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

solve()

Submission status: Accepted

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

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

print(result)

Submission status: Accepted

Solution code:
nab = input().split()

n = int(nab[0])
a = int(nab[1])
b = int(nab[2])
list = [n*a, b]
print(min(list))

Submission status: Accepted

Solution code:
# coding:utf-8
N, A, B = map(int, input().split())
price1 = N*A
price2 = B

if price1 < price2:
    print(price1)
else:
    print(price2)

Submission status: Accepted

Solution code:
n,a,b = [int(x) for x in raw_input().split()]
print min(n*a,b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python

nab = input().split(" ")

A = int(nab[0]) * int(nab[1])
B = int(nab[2])

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

Submission status: Accepted

Solution code:
#!/usr/bin/python

import sys

def main(argv):
    line = sys.stdin.readline()
    while line:
        n, a, b = map(lambda x: int(x), line.rstrip("\n").split(" ", 3))
        print(min(n * a, b))
        line = sys.stdin.readline()

if __name__ == "__main__":
    main(sys.argv)

Submission status: Accepted

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

C = N*A

if C > B:
	print(B)

else:
	print(C)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

"""abc080_a"""


import sys


def main():
    """Main function."""
    n, a, b = list(map(int, input().split(' ')))

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


if __name__ == '__main__':
    sys.exit(main())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

line = sys.stdin.readline()
N, A, B = [int(x) for x in line.strip().split()]
r = min(N * A, B)
print(r)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, a, b = map(int, input().split())		# 5 7 2

print( min(n*a, b) )

Submission status: Accepted

Solution code:
def main():
    N, A, B = map(int, input().split())

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

main()

Submission status: Accepted

Solution code:
a = map(int,raw_input().split())
print(min(a[0]*a[1],a[2]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s=input().split()
N=int(s[0]);A=int(s[1]);B=int(s[2])
if (N*A<=B):
    print("{0}".format(N*A))
else:
    print("{0}".format(B))

Submission status: Accepted

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

Submission status: Accepted

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

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