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 scan=new Scanner(System.in);
int nn=scan.nextInt();
int kk=scan.nextInt();
  
int na=Math.max(nn,kk);
int nb=Math.min(nn,kk);

int sum=0;
int i=0;
for(i=0;i<na;i++){
  sum=sum+nb*(int)Math.pow(10,i);
}
  
System.out.println(sum);
}
}
