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 C++14 (GCC 5.4.1) (judge verdict: Accepted)

/*我是菜鸡
╭╮＿＿╭╭╭╭╭＿＿╭╮
│　　　　　　　　　　　│　
│　　　　　　　　　　　│　
│　●　╭———╮　●　│　
│≡　　│●　●│　　≡│
│　　  ╰———╯　　　│
╰——┬○————┬—○╯
*/
#include<bits/stdc++.h>
#define _for(i,a,b) for(int i = (a);i<(b);++i)
#define cci ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int maxn = 1000 + 5;
int ans[maxn][maxn];
int main() {
	cci;
	//ifstream cin("E:\\acm dream\\in.txt");
	//ofstream cout("E:\\acm dream\\out.txt");
	int a, b;
	while (cin >> a >> b) {
		if (a >= b)_for(i, 0, a)cout << b;
		else _for(i, 0, b)cout << a;
		cout << endl;
	}
	return 0;
}