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.*;
public class Main{
   public static void main(String[] args) {
     Scanner sc = new Scanner(System.in);
     int  n = sc.nextInt();
     int m = sc.nextInt();
     int ans=0;
     if(n <= m){
       for(int i=0;i<m;i++){
         ans+=Math.pow(10,i)*n;
       }
     }else{
       for(int i=0;i<n;i++){
         ans+=Math.pow(10,i)*m;
       }
     }
     System.out.println(ans);
   }
}
