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:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
mod = 1000000007

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

#B
def B():
    return

#C
def C():
    n = I()
    f = LIR(n)
    po = [1]*11
    for i in range(n):
        k = 0
        p = 1
        for j in range(10):
            k += p*f[i][j]
            p *= 2
            po[j+1] = p
        f[i] = k
    p = LIR(n)
    ans = -float("inf")
    for i in range(1,1024):
        k = 0
        for j in range(n):
            c = i&f[j]
            s = 0
            for l in po:
                if c&l:s += 1
            k += p[j][s]
        ans = max(ans,k)
    print(ans)
#D
def D():
    n,C = LI()
    T = [[0 for i in range(100002)] for j in range(C)]
    for i in range(n):
        s,t,c = LI()
        c -= 1
        T[c][s] += 1
        T[c][t+1] -= 1
    for c in range(C):
        for i in range(100000):
            T[c][i+1] += T[c][i]
    ans = 0
    for i in range(100000):
        k = 0
        for c in range(C):
            if T[c][i]:k += 1
        ans = max(ans, k)
    print(ans)
#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == "__main__":
    A()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(min(a*n,b))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
NAB=list(map(int,input().split()))
m=NAB[0]*NAB[1]

if m>NAB[2]:
  print(NAB[2])
else:
  print(m)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# encoding:utf-8
import copy
import numpy as np
import random

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


ans = min(b,a*n)

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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


def main():
    n, a, b = map(int, input().split())
    if n * a > b:
        print(b)
    elif n * a <= b:
        print(n * a)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

p1 = n * a
p2 = b

print(min(p1, p2))

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc080/tasks/abc080_a

import itertools
import collections
import bisect

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def parking(N: int, A: int, B: int) -> int:
    return min(N * A, B)


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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

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


if __name__ == '__main__':
    main()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

print(min(A*N,B))

Submission status: Accepted

Solution code:
ri = lambda: int(input())
rl = lambda: list(map(int,input().split()))
rr = lambda N: [ri() for _ in range(N)]
YN = lambda b: print('YES') if b else print('NO')
yn = lambda b: print('Yes') if b else print('No')
OE = lambda x: print('Odd') if x%2 else print('Even')
INF = 10**18

n,a,b=rl()

print(min(a*n,b))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(min(N*A, B))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = min(A * N , B)

print(ans)
print()

Submission status: Accepted

Solution code:
import math
import numpy as np
import sys
input = sys.stdin.readline
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

N,A,B = IL()

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

Submission status: Accepted

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

print(min(a* n, b))

Submission status: Accepted

Solution code:
l = [ int(i) for i in input().split()]
if l[0]*l[1]<l[2]:
    print(l[0]*l[1])
else:
    print(l[2])

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

print(int_t * int_a if int_t * int_a <= int_b else int_b)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
nab = list(int(i) for i in input().split())
if nab[0] * nab[1] < nab[2]:
    print(nab[0] * nab[1])
else:
    print(nab[2])

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

Submission status: Accepted

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

parking = lambda total, B: total if  total < B else B
total = N*A
print(parking(total, B))

Submission status: Accepted

Solution code:
""" AtCoder """

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

print(min(N*A, B))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def ma():return map(int, input().split())#a,b,c,d or n,k
x,y,z = ma()
print(min(x*y,z))

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

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

Submission status: Accepted

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

print(min( A * N,B))

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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


abc080_a()

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
l,m,n=map(int,input(" ").split())
if l*m>=n:
  print(n)
else:
  print(l*m)

Submission status: Accepted

Solution code:
n, a, b = [int(i) for i in input().split()]
print(min(a*n, 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=map(int,input().split())
li=[n*a,b]
print(min(li))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


def main():
    """Function."""
    n, a, b = map(int, input().split())
    if a*n < b:
        print(a*n)
    else:
        print(b)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# Parking
print((lambda x: min(x[0] * x[1], x[2]))(list(map(int, input().split()))))

Submission status: Accepted

Solution code:
list = [int(i) for i in input().split()]

fee = list[0] * list[1]

print(min(fee, list[2]))

Submission status: Accepted

Solution code:
from statistics import mean, median,variance,stdev
import sys
import math

n=input().split()
a = []
for i in range(len(n)):
    a.append(int(n[i]))
if (a[0]*a[1]) < a[2]:
    print(a[0]*a[1])
else: print(a[2])

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=[int(i) for i in input().split()]
print(min(n*a,b))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
[time, price_by_hour , constant_price] = list(map(int,input().split()))

if price_by_hour * time > constant_price:
	print(constant_price)
else:
	print(price_by_hour * time)

Submission status: Accepted

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

Submission status: Accepted

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

print(min(n * a, b))

Submission status: Accepted

Solution code:
a=input().strip().split(" ")

b=[int(i) for i in a]

c=b[0]*b[1]

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sun Nov  4 21:46:51 2018

@author: sk
"""


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

s1=a*b


if s1>=c:
  print(c)

else:
  print(s1)

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n,a,b=(int(i) for i in input().split(' '))
print(min(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, raw_input().split())
print min(A * N, B)

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

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(B if N*A > B else 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 = [int(m) for m in input().split(" ")]

print(min(a*n, b))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding: utf-8
N, A, B = map(int, input().split())
print(min(A * N, 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())
print(min(a*n,b))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- 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())

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

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

Submission status: Accepted

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

print(min(n*a, b))

Submission status: Accepted

Solution code:
# coding:utf-8

INF = float('inf')


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


N, A, B = inpl()

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

Submission status: Accepted

Solution code:
import math


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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/python3

from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]


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


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


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


if __name__ == '__main__':
    main()

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

print(min(N*A,B))

Submission status: Accepted

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


def li_input():
    return [int(_) for _ in input().split()]


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

dp = None


def main():
    N, A, B = li_input()

    print(min(N * A, B))


main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = list(map(int,input().split(" ")))
A = N[0]*N[1]
if N[2] > A:
    print(A)
else:
    print(N[2])

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from collections import defaultdict
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
AtoZ = [chr(i) for i in range(65,65+26)]
atoz = [chr(i) for i in range(97,97+26)]

def inpl(): return list(map(int, input().split()))
def inpl_str(): return list(input().split())

N,A,B = inpl()

print(min(N*A,B))

Submission status: Accepted

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

a = x*y
if a >= z:
    print(z)
else:
    print(a)

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:
#-*-coding:utf-8-*-

def main():
    n, a, b = 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())
print( min(A*N,B))

Submission status: Accepted

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

Submission status: Accepted

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

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=list(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:
money,time,allmoney = map(int,input().split())
product = money * time
print(product if product < allmoney else allmoney)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding utf-8
n=[int(i) for i in 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 = (int(x) for x in raw_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())
pA = N*A
if pA > B:
  print(B)
else:
  print(pA)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

aplan = n * a
bplan = b

if aplan > bplan:
    print(bplan)
else:
    print(aplan)

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

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

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 = input().split()
N = int(n)
A = int(a)
B = int(b)

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

Submission status: Accepted

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

#A=list(map(int, input().split()))

ans=[A*N, B]

print(min(ans))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(min(T * A, B))

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, a, b = list(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(N*A,B))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(min(N * A, B))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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