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;
using System.IO;
using System.Linq;
using static System.Math;
using System.Text;
using System.Threading;
using System.Globalization;
using System.Runtime.CompilerServices;

namespace AtCorder
{
    public static class Program
    {
        static public void Main(string[] args)
        {
            string str1 = "";
            string str2 = "";
            int[] input = Console.ReadLine().Split(' ').Select(int.Parse).ToArray();

            for (int i = 1; i <= input[1]; i++)
            {
                str1 = str1 + input[0].ToString();
            }
            for (int i = 1; i <= input[0]; i++)
            {
                str2 = str2 + input[1].ToString();
            }

            if (string.Compare(str1, str2) >= 0)
            {
                Console.WriteLine(str2);
            }
            else
            {
                Console.WriteLine(str1);
            }
        }
    }
}