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 Python (3.4.3) (judge verdict: Accepted)

def dctLr(lst1, lst2):
  length = min(len(lst1), len(lst2))
  for i in range(length):
    if lst1[i] < lst2[i]:
      return lst1
    elif lst1[i] > lst2[i]:
      return lst2
  return shorter(lst1, lst2)

def shorter(lst1, lst2):
  diff = len(lst1) - len(lst2)
  if diff < 0:
    return lst1
  else:
    return lst2

inp = input().split(' ')
print(''.join(dctLr(inp[0] * int(inp[1]), inp[1] * int(inp[0]))))