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 C# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using System.Collections.Generic;

namespace ATCoder
{
    class Program
    {
        static void Main( string[] args )
        {
            var list = new List<string>();
            var input = Console.ReadLine();
            string[] token = input.Split( ' ' );
            string a = token[ 0 ];
            string b = token[ 1 ];

            string str_a = ConvertStr( a , int.Parse( b ) );
            string str_b = ConvertStr( b , int.Parse( a ) );
            list.Add(str_a);
            list.Add(str_b);
            list.Sort();

            Console.WriteLine(list[0]);
        }

        static string ConvertStr(string str, int num)
        {
            string ret = "";

            for(int i = 0 ;i < num ;i++ )
            {
                ret += str;
            }

            return ret;
        }
    }
}