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.Text;
using System.Collections.Generic;
using static System.Math;
using System.Linq;
using static System.Array;

namespace ConsoleApp2
{
    class Program
    {
        static void Main(string[] args)
        {
            //var N = long.Parse(Console.ReadLine());
            //var S = Console.ReadLine();

            var inp = Console.ReadLine().Split(' ').Select(x => long.Parse(x)).ToArray();
            var a = inp[0];
            var b = inp[1];

            
            if(a < b)
            {
                var ans = new long[b];
                for (int i = 0; i < b; i++)
                {
                    ans[i] = a;
                }
                Console.WriteLine(String.Join("",ans));
            }
            else
            {
                var ans = new long[a];
                for (int i = 0; i < a; i++)
                {
                    ans[i] = b;
                }
                Console.WriteLine(String.Join("", ans));
            }
            
            
        }

    }
}