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: Wrong Answer)

#include <stdio.h>
int main(void){
   int a,b,i;
   int num1,num2;
   
   scanf("%d%d",&a,&b);
   num1 = a;
   num2 = b;
   for(i=1; i<b; i++){
        num1 = (num1*10)+a;
        printf("%d\n",num1);
   }
    for(i=1; i<a; i++){
        num2 = (num2*10)+b;
        printf("%d\n",num2);
   }
   if(num1<=num2){
       printf("%d",num1);
   }else if(num2 <= num1){
       printf("%d",num2);
   }
   return 0;
    
}