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

#include<stdio.h>
int main()
{
	int a,b,c,d,m,n;
	scanf("%d %d",&m,&n);
	a=m;
	b=n;
	c=0;
	d=0;
	while(a!=0)
	{
		a--;
		c=10*c+n;
	}
	while(b!=0)
	{
		b--;
		d=10*d+m;
	}
	if(c>=d)
	printf("%d",c);
	else 
	printf("%d",d);
}