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 Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.util.*;

public class Main {	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String[] str = sc.nextLine().split(" ");
		String a = str[0];
		String b = str[1];
		
        String str1 = "";
        for(int i = 0; i < Integer.valueOf(b); i++) {
        	str1+=a;
        }
        
        String str2 = "";
        for(int i = 0; i < Integer.valueOf(a); i++) {
        	str2+=b;
        }
        int result = Integer.compare(Integer.valueOf(a), Integer.valueOf(b));
        if(result == 0) System.out.println(a);
        else if(result == -1) System.out.println(a);
        else if(result == 1) System.out.println(b);
	}
}