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 Haskell (GHC 7.10.3) (judge verdict: Accepted)

toInt :: (String -> Int)
toInt x = read x ::Int


getInts = do
    x <- getLine
    let y = (map$toInt)$words x
    return y


ten :: Int -> Int
ten x = x * 10


create :: Int -> Int -> Int
create n m =
    let s = take m (iterate ten n)
        r = sum s
    in r


ret :: Int -> Int -> Int
ret n m
    | n < m = create n m
    | m < n = create m n
    | otherwise = create n m


main = do
    x <- getInts
    let n = head x
    let m = last x
    let r = ret n m
    putStrLn $ show r