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 Fortran (gfortran v4.8.4) (judge verdict: Accepted)

program main
    implicit none

!    character,allocatable :: str(:)
     character(:),allocatable :: ca, cb!, cca, ccb
    integer :: nb , ia, ib, i, ma, mb, tena, tenb
    character(100) :: cca, ccb
    character(1) :: a,b 
    

    read(*,*) a, b
    
    read(a,*) ia     ! 内部read文で文字列を整数に変換
    read(b,*) ib     ! 内部read文で文字列を整数に変換


    tena=0
    tenb=0
    
    do i=1,ib
       tena=tena+10**(i-1)
       ma=tena*ia
    enddo
    do i=1,ia
       tenb=tenb+10**(i-1)
       mb=tenb*ib
    enddo

!    print *, ma, mb
    
    write(cca,*) ma    ! 内部write文で整数を文字列に変換
    ca =trim(adjustl(cca)) 
    write(ccb,*) mb    ! 内部write文で整数を文字列に変換
    cb =trim(adjustl(ccb)) 
    
    if(LGE(ca,cb).eqv. .true. ) then
       print *,cb
    else
       print *, ca
    end if


  end program main