output_description: Print the lexicographically smaller of the two strings. (If the two strings
  are equal, print one of them.)
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      a b
attempt: # -*- coding: utf-8 -*-
  # abc152/abc152_b
  import sys
  
  s2nn = lambda s: [int(c) for c in s.split(" ")]
  ss2nn = lambda ss: [int(s) for s in list(ss)]
  ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
  i2s = lambda: sys.stdin.readline().rstrip()
  i2n = lambda: int(i2s())
  i2nn = lambda: s2nn(i2s())
  ii2ss = lambda n: [i2s() for _ in range(n)]
  ii2nn = lambda n: ss2nn(ii2ss(n))
  ii2nnn = lambda n: ss2nnn(ii2ss(n))
  
  
  def main():
      a, b = i2nn()
      print(min(str(a) * b, str(b) * a))
      return
  
  
  main()
  
problem_description: 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?
samples: [{"input": "4 3", "output": "3333\n    \n\nWe have two strings `444` and `3333`. Between them, `3333` is the\nlexicographically smaller.\n\n* * *"}, {"input": "7 7", "output": "7777777"}]