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
def smaller(a, b):
    n = min(len(a), len(b))
    for i in reversed(range(n)):
        if a[i] < b[i]:
            return True
        elif b[i] < a[i]:
            return False
    return len(a) < len(b)
    
  
    

a, b = [int(x) for x in raw_input().split()]

a_r = ''.join([str(a) for _ in range(b)])

b_r = ''.join([str(b) for _ in range(a)])

if smaller(a_r, b_r):
    print(a_r)
else:
    print(b_r)





