Given are 1-digit positive integers a and b. Consider these two strings: the concatenation of b copies of the digit a, and the concatenation of a copies of the digit b. Which of these is lexicographically smaller?

Constraints

* 1 \leq a \leq 9
* 1 \leq b \leq 9
* a and b are integers.

Input

Input is given from Standard Input in the following format:


a b


Output

Print the lexicographically smaller of the two strings. (If the two strings are equal, print one of them.)

Examples

Input

4 3


Output

3333


Input

7 7


Output

7777777
import java.util.Scanner;
public class Main {
	public static void main(String[]args) {
		Scanner s = new Scanner(System.in);
		int a1 = s.nextInt();
		int b1 = s.nextInt();
		String a = Integer.toString(a1);
		String b = Integer.toString(b1);
		
			for(int i = 0; i<b1-1;i++) {
				a += a.charAt(0);
			}
			
			for(int i = 0; i<a1-1;i++) {
				b += b.charAt(0);
			}
		
		if(a.compareTo(b)<=0) {
			System.out.println(a);
		}else System.out.println(b);
		
		
		
		
	}
}
