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: Wrong Answer)

using System;

class sample
{
	static void Main()
	{
		string[] input =Console.ReadLine().Split(' ');

		int[] inputnum = new int[2];
		string input0 ="";
		string input1 ="";


		inputnum[0]=Convert.ToInt32(input[0]);
		inputnum[1]=Convert.ToInt32(input[1]);

		for(int i=1;i<=inputnum[0];i++)
		{
			input1+=input[1];
		}

		for(int i=1;i<inputnum[1];i++)
		{
			input0+=input[0];
		}

		if(input0.CompareTo(input1)==0 || input0.CompareTo(input1)==1)
		{
			Console.WriteLine(input0);
		}

		else
		{
			Console.WriteLine(input1);
		}
	}
}