Problem:
Score : 200 points

Problem Statement

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.)

Sample Input 1

4 3

Sample Output 1

3333

We have two strings 444 and 3333. Between them, 3333 is the lexicographically smaller.

Sample Input 2

7 7

Sample Output 2

7777777

Solution in Ruby (2.3.3) (judge verdict: Accepted)

input = gets.split

int1 = ''
int2 = ''
for i in 1..input[1].to_i do
  int1 += input[0]
end

for i in 1..input[0].to_i do
  int2 += input[1]
end

arr = []
arr.push(int1, int2)

arr = arr.sort
print arr[0].to_i