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 Go (1.6) (judge verdict: Accepted)

package main

import (
	"fmt"
)

func main() {
	var a, b int
	fmt.Scanf("%d %d", &a, &b)
	s1a := make([]rune, b)
	s2a := make([]rune, a)
	var c rune
	c = []rune(fmt.Sprintf("%d", a))[0]
	for i := 0; i < b; i++ {
		s1a[i] = c
	}
	c = []rune(fmt.Sprintf("%d", b))[0]
	for i := 0; i < a; i++ {
		s2a[i] = c
	}
	s1 := string(s1a)
	s2 := string(s2a)
	if s1 < s2 {
		fmt.Printf("%s\n", s1)
	} else {
		fmt.Printf("%s\n", s2)
	}
}