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 Java (OpenJDK 11.0.6) (judge verdict: Accepted)

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String[] line = sc.nextLine().split(" ", 0);
		char A = line[0].charAt(0);
		char B = line[1].charAt(0);
		StringBuilder sb = new StringBuilder();
		if (A <= B) {
			for (int i = 0; i < Integer.parseInt(line[1]); i++) {
				sb.append(A);
			}
			System.out.println(sb.toString());
		} else {
			for (int i = 0; i < Integer.parseInt(line[0]); i++) {
				sb.append(B);
			}
			System.out.println(sb.toString());
		}

	}
}