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;

class ABC
{
    static void Main()
    {
        string input = Console.ReadLine();
        string[] inputA = input.Split(' ');
        string A = inputA[0];
        string B = inputA[1];
        System.Text.StringBuilder sbA = new System.Text.StringBuilder();
        System.Text.StringBuilder sbB = new System.Text.StringBuilder();


        for (int i = 0; i < int.Parse(B); i++)
        {

            sbA.Append(A);
        }
        for (int i = 0; i < int.Parse(A); i++)
        {

            sbB.Append(B);
        }
        string AA = sbA.ToString();
        string BB = sbB.ToString();
        string[] Ans = new[] { AA, BB };
        Array.Sort(Ans);

        Console.WriteLine(Ans[0]);
    }
}