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;
    scanf("%d%d", &a, &b);
    char A[a], B[b];
    for (i = 0; i < a; i++)
    {
        A[i] = b+'0';
    }

    for (i = 0; i < b; i++)
    {
        B[i] = a+'0';
    }
    
    if(A[0]<B[0]){
        printf("%s",A);
    }
    
    else printf("%s",B);

    return 0;
}