import java.util.*; import java.io.*; import java.math.*; import java.util.stream.*; import java.util.function.*; class Main implements Runnable { public void solve() { int a = in.nextInt() , b = in.nextInt() , c = in.nextInt(); out.println(Math.min(a * c , b)); } class UnionFind { private int [] rank , parents , size ; private int group_count ; UnionFind(int n) { this.rank = new int[n]; this.parents = new int[n]; this.size = new int[n]; this.group_count = n ; Arrays.fill(size , 1); for(int i = 0 ; i < n ; i ++ ) parents[i] = i ; } public int groupcount() { return this.group_count ; } public int membercount(int x) { return size[root(x)] ; } public boolean same(int x , int y) { return root(x) == root(y) ; } public int root(int x) { if(x == parents[x]) return x ; else parents[x] = root(parents[x]); return parents[x]; } public void unite(int l , int r) { int left = root(l); int right = root(r); int parent = -1 , child = -1 ; if(left == right) return ; parent = rank[left] > rank[right] ? left : right; child = rank[left] > rank[right] ? right : left ; --group_count; parents[child] = parent ; if(rank[parent] == rank[child]) rank[parent] ++ ; size[parent] += size[child] ; } @SuppressWarnings("unchecked") public List [] groupList() { List [] ret = new ArrayList[group_count]; int count = 0 ; for(int i = 0 ; i < group_count ; i ++) ret[i] = new ArrayList<>(); Map> mp = new HashMap<>(); for(int i = 0 ; i < parents.length ; i ++ ) { int par = root(i); if(!mp.containsKey(par)) mp.put(par , new ArrayList<>()); mp.get(par).add(i); } for(List temp : mp.values()) ret[count++] = temp ; return ret ; } } // =============================================================================================================== // =============================================================================================================== public PrintWriter out = new PrintWriter(System.out); public In in = new In() ; public static final int inf = (1 << 30); public static final long lnf = (1L << 60); public static final String yes = "Yes" , no = "No" ; public static final int mod7 = 1000000007 , mod9 = 998244353; public static final int [] dy4 = {-1,0,1,0} , dx4 = {0,1,0,-1}; public static final int [] dy8 = {-1,-1,-1,0,1,1,1,0} , dx8 = {-1,0,1,1,1,0,-1,-1}; public int index(int y , int x , int w) { return y * w + x ; } public boolean out(int y , int x , int h , int w) { return y < 0 || x < 0 || y >= h || x >= w ; } // =============================================================================================================== public static void main(String ... args) { new Thread(null, new Main(), "", Runtime.getRuntime().maxMemory()).start(); } public void run() { solve(); out.flush(); } // =============================================================================================================== // =============================================================================================================== public Integer [] parseInt(int [] array) { return IntStream.of(array).boxed().toArray(Integer[]::new); } public Long [] parseLong(long [] array) { return LongStream.of(array).boxed().toArray(Long[]::new); } // =============================================================================================================== } class In { private final InputStream in = System.in; private final Scanner sc = new Scanner(System.in); private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1; } private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126; } private boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) { ptr++; } return hasNextByte(); } public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } public double nextDouble() { return Double.parseDouble(next()); } public char nextChar() { return next().charAt(0); } public BigInteger nextBigInteger() { return sc.nextBigInteger(); } public int [] nextInt(int n) { int [] array = new int[n]; for(int i = 0 ; i < n ; i ++) { array[i] = nextInt(); } return array ; } public int [][] nextInt(int n , int m) { int [][] array = new int[n][m]; for(int i = 0 ; i < n ; i ++) { array[i] = nextInt(m); } return array ; } public long [] nextLong(int n) { long [] array = new long[n]; for(int i = 0 ; i < n ; i ++) { array[i] = nextLong(); } return array ; } public long [][] nextLong(int n , int m) { long [][] array = new long[n][m]; for(int i = 0 ; i < n ; i ++) { array[i] = nextLong(m); } return array ; } public double [] nextDouble(int n) { double [] array = new double[n]; for(int i = 0 ; i < n ; i ++) { array[i] = nextDouble(); } return array ; } public String [] next(int n) { String [] array = new String[n]; for(int i = 0 ; i < n ; i ++) { array[i] = next(); } return array ; } public String [][] next(int n , int m) { String [][] array = new String[n][m]; for(int i = 0 ; i < n ; i ++) { array[i] = next(m); } return array ; } public char [] nextChar(int n) { char [] array = new char[n]; String string = next() ; for(int i = 0 ; i < n ; i ++) { array[i] = string.charAt(i); } return array ; } public char [][] nextChar(int n , int m) { char [][] array = new char[n][m]; for(int i = 0 ; i < n ; i ++) { array[i] = nextChar(m); } return array ; } }