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;
import java.util.Set;
import java.util.TreeSet;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		Integer a=sc.nextInt(),b=sc.nextInt();
		Set<String> set = new TreeSet<>();
		String A="",B="";

		for(int i=0;i<a;i++) {
			B+=b.toString();
		}
		for(int i=0;i<b;i++) {
			A+=a.toString();
		}
		set.add(A);
		set.add(B);
		for(String str : set) {
				System.out.println(str);
			return;
		}

	}
}