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 sca = new Scanner(System.in);
	// 入力

	int a = sca.nextInt();
	int b = sca.nextInt();


	if(a > b) {
		for(int i = 1; i <= a; i++) {
			System.out.print("" + b);
		}
	}
	else {
		for(int i = 1; i <= b; i++) {
			System.out.print("" + a);
		}
	}

	System.out.println("");
	// 後始末
	sca.close();
	}
}