P25590 [AtCoder] Comparing Strings
入门
题目描述

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?

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.)

Constraints

  • $1 \leq a \leq 9$
  • $1 \leq b \leq 9$
  • a and b are integers.

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

输入格式

见题面 Input 部分

输出格式

见题面 Output 部分

样例输入
4 3
样例输出
3333