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: Accepted)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;

public class Main {
	
	public static void main(String args[]) throws IOException {
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		
		String[] parts;
		
		parts = br.readLine().split(" ");
		
		int a = Integer.parseInt(parts[0]);
		int b = Integer.parseInt(parts[1]);
		
		String s1 ="";
		for (int i = 0; i<a; i++) {
			s1+=parts[1];
		}
		
		String s2="";
		for (int i = 0; i<b; i++) {
			s2+=parts[0];
		}
		if(s1.compareTo(s2)<0) {
			System.out.println(s1);
			
		}else{
			System.out.println(s2);
		}
	}
	
}