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 (Python):
(a, b) = map(str, input().split())
if a>=b:
    for i in range(0,int(a)):
        print(b,end="")

else:
    for i in range(0,int(b)):
        print(a,end="")

Solution (Python):
a, b = input().split()
print(a * int(b) if a * int(b) < b * int(a) else b * int(a))

Solution (Python):
import sys
from operator import itemgetter
import collections


def main():
    input = sys.stdin.readline
    a, b = map(int, input().split())
    print(str(a)*b if a<b else str(b)*a)

    
if __name__ == '__main__':
    main()

Solution (Python):
a,b=map(int,input().split())
a_b=str(a)*b
b_a=str(b)*a
if a_b<b_a:
    print(a_b)
else:
    print(b_a)

Solution (Python):
def f(m,n):
    a=n*((10**m)-1)//9
    b=m*((10**n)-1)//9
    if a>b:
        return a
    else:
        return b 
m,n=map(int,input().split())
print(f(m,n))

Solution (Python):
a=[str(i) for i in input().split()]
if a[0]<=a[1]:
    b=[a[0] for i in range(int(a[1]))]
    b=''.join(b)
    print(b)
else:
    b=[a[1] for i in range(int(a[0]))]
    b=''.join(b)
    print(b)

Solution (Python):
def main():
    a, b = input().split()
    A = int(a*int(b))
    B = int(b*int(a))
    if A < B:
        print(B)
    else:
        print(A)
if __name__ == '__main__':
    main()

Solution (Python):
def main(a, b):
    print(min(str(a) * int(b), str(b) * int(a)))


if __name__ == '__main__':
    a, b = input().split()
    main(a, b)

Solution (Python):
a, b = map(int, input().split())
if (a == b and a < b) or b < a:
    ans = [str(b)] * a
else:
    ans = [str(a)] * b
print("".join(ans))

Solution (Python):
a, b = map(int, input().split())


min_word = ""
for _ in range(max(a, b)):
    min_word += str(min(a, b))

print(min_word)

Solution (Python):
a, b = input().split()
print(min(a*int(b),b*int(a)))

Solution (Python):
a, b = input().split()

if a > b:
    print(b * int(a))
else :
    print(a * int(b))

Solution (Python):
a, b = input().split()
if a < b:
    print(a * int(b))
else:
    print(b * int(a))

Solution (Python):
a=input().rstrip().split(" ")
b=a[0]*int(a[1])
c=a[1]*int(a[0])

if b > c:
  print(c)
else:
  print(b)

Solution (Python):
a,b=map(int,input().split())
if a<b:
    ans=str(a)*b
else:
    ans=str(b)*a
print(ans)

Solution (Python):
a, b = map(int, input().split())
s = ''

if a < b:
  for i in range(b):
    s += str(a)
else:
  for i in range(a):
    s += str(b)
    
print(s)

Solution (Python):
a, b = list(input().split())

ab = a * int(b)
ba = b * int(a)

if ab <= ba:
  print(ab)
else:
  print(ba)

Solution (Python):
a,b=map(int,input().split())
A=str(a)*b
B=str(b)*a
for i in range(min(len(A),len(B))):
  if int(A[i])>int(B[i]):
    print(B)
    break
  else:
    print(A)
    break

Solution (Python):
import sys
a, b = [int(e) for e in sys.stdin.readline().rstrip().split(" ")]
print(str(min([a, b])) * max([a, b]))

Solution (Python):
d = input()
d = d.split(" ")
a = int(d[0])
b = int(d[1])


if a < b :
    a = str (a)
    x = ""
    for i in range (b):
        x += a
    print (x)
else:
    b = str (b)
    y = ""
    for i in range(a):
        y += b
    print(y)

Solution (Python):
In = input().split(" ")
a = int(In[0])
b = int(In[1])

if a<b:
  for i in range(b):
  	print("{0}".format(a),end="")
else:
  for i in range(a):
  	print("{0}".format(b),end="")

Solution (Python):
a,b=map(str,input().split())

if a>b:
  print(b*int(a))
else:
  print(a*int(b))

Solution (Python):
A, B = map(int, input().split())

if A <= B:
    for i in range(B):
        print(A, end="")

else:
    for i in range(A):
        print(B, end="")

Solution (Python):




















a, b = map(int, input().split())

if a < b:
    print(str(a) * b)
else:
    print(str(b) * a)

Solution (Python):
a,b = map(int, input().split())
print(str(min(a,b)) * max(a,b))

Solution (Python):
a,b = map(int,input().split())
if a > b:
  print(str(b)*a)
else:
  print(str(a)*b)

Solution (Python):
a=sorted(list(map(int,input().split())))
print(str(a[0])*a[1])

Solution (Python):
a, b = input().split()
aa = a * int(b)
bb = b * int(a)
words = [aa, bb]
words.sort()
print(words[0])

Solution (Python):
a,b = map(int,input().split())
if (a>b):
  print(str(b)*a)
else:
  print(str(a)*b)

Solution (Python):
a,b=map(int,input().split())

A=""
for i in range(b):
    A+=str(a)

B=""
for i in range(a):
    B+=str(b)

if A<=B:
    print(A)
else:
    print(B)

Solution (Python):
a,b = [int(i) for i in input().split()]

print(str(min(a, b)) * max(a, b))

Solution (Python):
a,b = input().split()
if a > b:
    print(b * int(a))
else:
    print(a * int(b))

Solution (Python):
a, b = map(int,input().split())

A = ''
B = ''

for i in range(b):
    A += str(a)

for i in range(a):
    B += str(b)

if a<b:
    print(A)
elif a>b:
    print(B)
else:
    print(A)

Solution (Python):
a, b = map(int, input().split())

l = []
l.append(str(a) * b)
l.append(str(b) * a)

l.sort()

print(l[0])

Solution (Python):
a,b=map(int,input().split())
a_b=str(a)*int(b)
b_a=str(b)*int(a)
if a_b>b_a :
    print(b_a)
else:
    print(a_b)

Solution (Python):
a, b = input().split()

a_b = a * int(b)
b_a = b * int(a)

print(b_a) if (a_b > b_a) else print(a_b)

Solution (Python):
get = list(map(int, input().split()))
a = get[0]
b = get[1]
if a <= b:
  print(str(a) * b)
elif a > b:
  print(str(b) * a)

Solution (Python):
a,b=input().split()
a=int(a)
b=int(b)
if a >= b:
    for i in range(a):
        print(b,end='')
else:
    for i in range(b):
        print(a,end='')

Solution (Python):
a, b = input().split()
if a < b:
  print(a*int(b))
else:
  print(b*int(a))

Solution (Python):
a, b = map(int,input().split())

if a >= b:
  print(str(b)*a)
  
else:
  print(str(a)*b)

Solution (Python):
a,b=map(int,input().split())
l=[]
if a>b:
  for _ in range(a):
    l.append(str(b))
  print("".join(l))
else:
  for _ in range(b):
    l.append(str(a))
  print("".join(l))

Solution (Python):
a = list(map(int, input().split()))
if a[0] > a[1]:
    print(str(a[1])*a[0])
else:
    print(str(a[0])*a[1])

Solution (Python):
a, b = input().split()
a2 = []
b2 = []
for _ in range(int(b)):
  a2.append(a)
for _ in range(int(a)):
  b2.append(b)
a3 = int("".join(a2))
b3 = int("".join(b2))
if a3 > b3:
  print(a3)
else:
  print(b3)

Solution (Python):
a, b = map(int, input().split())
print(sorted([str(a)*b, str(b)*a])[0])

Solution (Python):
a, b = map(int, input().split())
s = [str(a) * b, str(b) * a]
s.sort()
print(s[0])

Solution (Python):
a, b=map(int, input().split())
print(str(min(a,b))*max(a,b))

Solution (Python):
a, b = list(map(int,input().split()))
print(sorted([str(a)*b,str(b)*a])[0])

Solution (Python):
a,b = map(int,input().split())

A = [a]*b
B = [b]*a

AA = int("".join(map(str, A)))
BB = int("".join(map(str, B)))

if A >= B:
    print(BB)
else:
    print(AA)

Solution (Python):
a = list(map(str, input().split()))
a[0],a[1] = a[0]*int(a[1]),a[1]*int(a[0])
a.sort()
print(a[0])

Solution (Python):
a,b = map(int,input().split())
print(str(a)*b if a < b else str(b)*a)

Solution (Python):
Input = list(map(int, input().split()))
a = Input[0]
b = Input[1]


ra= 0
rb =0

for i in range(a):
  rb += b*(10**i)

for i in range(b):
  ra += a*(10**i)

if ra>=rb:
  print(ra)
else:
  print(rb)

Solution (Python):
A,B = map(int, input().split())

if A > B:
  text = ""
  for i in range(A):
    text = text + str(B)
  print(text)

elif A < B:
  text = ""
  for i in range(B):
    text = text + str(A)
  print(text)

else:
  text = ""
  for i in range(A):
    text = text + str(A)
  print(text)

Solution (Python):
a, b = map(int, input().split())
if a >= b:
  print(str(b)*a)
else:
  print(str(a)*b)

Solution (Python):
a, b = sorted(list(map(int, input().split())))
print(str(a)*b)

Solution (Python):

a, b = list(map(int, input().split()))

a, b = (a, b) if a < b else (b, a)

print(('%d' % (a)) * b)

Solution (Python):
a, b = list(map(int, input().split()))

ab = int("".join([str(a)] * b))
ba = int("".join([str(b)] * a))
print(ab if ab >= ba else ba)

Solution (Python):
def execute(key: int, base: str) -> str:
  s = ""
  for i in range(key):
    s += str(base)
  return s

a, b = input().split()
c = [execute(int(a), b), execute(int(b), a)]
print(sorted(c)[0])

Solution (Python):
a, b = map(int, input().split())

print(str(min(a,b)) * max(a,b))

Solution (Python):
a , b =input().split()
print(a*int(b) if a<=b else b*int(a))

Solution (Python):
a,b=input().split()
ans=[]
if a<b:
  for i in range(int(b)):
    ans.append(a)
else:
  for i in range(int(a)):
    ans.append(b)

print(''.join(ans))

Solution (Python):
a , b =input().split()
 
if a <= b:
    print(a*int(b))
else:
	print(b*int(a))

Solution (Python):
a,b=input().split()
c=a*int(b)
d=int(a)*b
if c<d:
  print(c)
else:
  print(d)

Solution (Python):
input_values = input().split()

a = input_values[0] * int(input_values[1])
b = input_values[1] * int(input_values[0])

if a < b:
    print(a)
else:
    print(b)

Solution (Python):
a,b = input().split()
print(a * int(b) if a <= b else b * int(a))

Solution (Python):
a,b=sorted(input().split());print(a*int(b))

Solution (Python):
def main(a, b):
    l = sorted([str(a) * b, str(b) * a])
    print(l[0])


if __name__ == "__main__":
    a, b = map(int, input().split())

    main(a, b)

Solution (Python):
a, b = map(str, input().split())
f = ""

if a <= b:
    for i in range(int(b)):
      f += a
else:
    for i in range(int(a)):
      f += b
print(f)

Solution (Python):
a, b = [i for i in input().split()]
if a <= b:
    print(int(b) * a)
else:
    print(int(a) * b)

Solution (Python):
q = list(map(int, input().split()))
a = b = 0
for i in range(q[0]):
    a += q[1] * 10**i
for j in range(q[1]):
    b += q[0] * 10**j
if a > b:
    print(a)
else:
    print(b)

Solution (Python):
i = list(map(int, input().split()))

print(str(sorted(i)[0]) * sorted(i)[1])

Solution (Python):
a, b = map(str, input().split())
a_list =[]
b_list =[]

for i in range(int(b)):
   a_list.append(a)

for i in range(int(a)):
   b_list.append(b)    

map_result = map(str, a_list)
result_a = ''.join(map_result)
map_result = map(str, b_list)
result_b = ''.join(map_result)

sorted_list = sorted([result_a,result_b])
print(sorted_list[0])

Solution (Python):
n, m = map(int, input().split())
ans = ""
if(n < m):
    for i in range(0, m):
        print(n, end = '')
else:
    for i in range(0, n):
        print(m, end = '')
print(ans)

Solution (Python):
a,b=map(int,raw_input().split())
if a<b:
  print b*str(a)
else:
   print a*str(b)

Solution (Python):


a,b = map(int,input().split())
aary = []
bary = []

for i in range(b):
    aary.append(a)
for i in range(a):
    bary.append(b)

anum = int("".join(map(str,aary)))
bnum = int("".join(map(str,bary)))

if a < b:
    print(anum)
else:
    print(bnum)

Solution (Python):

a,b = map(int,input().split())


if a < b:
    a,b=b,a

for i in range(a):
    print(b,end = '')

Solution (Python):
x, y = input().split(' ')
if x < y:
    print(x * int(y))
else:
    print(y * int(x))

Solution (Python):
if __name__ == "__main__":
    N, M = input().split()
    
    if N>=M:
        print(M*int(N))
    else:
        print(N*int(M))

Solution (Python):
a,b = map(int, input().split())
if a<b: print(str(a)*b)
else: print(str(b)*a)

Solution (Python):
n = input().split(' ')
a = n[0] * int(n[1])
b = n[1]* int(n[0])
if a < b :
    print(a)
else:
    print(b)

Solution (Python):
numlist = list(map(int, input().split()))
num = sorted(numlist)
ans = ''

for i in range(num[1]):
    ans  = ans + str(num[0])

print(int(ans))

Solution (Python):

import sys


def solve(a: int, b: int):
    if a < b:
        print(str(a)*b)
    if b < a:
        print(str(b)*a)
    if a == b:
        print(str(a)*b)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    a = int(next(tokens))  
    b = int(next(tokens))  
    solve(a, b)

if __name__ == '__main__':
    main()

Solution (Python):
a, b = map(int, input().split())
print(str(min(a, b))*max(a, b))

Solution (Python):
l = sorted(map(int, input().split()))
print(str(l[0])*l[1])

Solution (Python):
list_num = list(map(int, input().split(' ')))

if int(str(list_num[0])*list_num[1]) > int(str(list_num[1])*list_num[0]):
    print(int(str(list_num[0]) * list_num[1]))
else:
    print(int(str(list_num[1]) * list_num[0]))

Solution (Python):
a, b = map(int, input().split())
print(min(str(a) * b, a * str(b)))

Solution (Python):
x, y = input().split()
d = {"a": "0", "b": "0"}
d["a"] = x * int(y)
d["b"] = y * int(x)
print(min(d["a"], d["b"]))

Solution (Python):
a, b = map(str, input().split())

num1 = ""
num2 = ""
num1 = a * int(b)
num2 = int(a) * b
list = [num1, num2]
list2 = sorted(list)
print (list2[0])

Solution (Python):
ls = list(input().split(" "))
a = int(ls[0])
b = int(ls[1])
if (a<b):
  t = b
  b = a
  a = t
for i in range(a):
  print(b,end="")

Solution (Python):
a, b = map(str, input().split())

num1 = ""
num2 = ""
for i in range(int(a)):
  num1 = num1 + b
for i in range(int(b)):
  num2 = num2 + a
list = [num1, num2]
list2 = sorted(list)
print (list2[0])

Solution (Python):
n, m=input().split(' ')
n = int(n)
m = int(m)
nn = 0
mm = 0
for i in range(m):
	nn = nn + n * pow(10, i)
for i in range(n):
	mm = mm + m * pow(10, i)    
if n < m:
  print(nn)
else:
  print(mm)

Solution (Python):
a, b=input().split(' ')

if a < b:
  print(str(a)*int(b))
else:
  print(str(b)*int(a))

Solution (Python):
a, b=list(map(int, input().split()))
big = 0
small =0
if a > b:
  big = a
  small = b
else:
  big = b
  small = a
  
s = ""
for i in range(big):
  s += str(small)
  
print(s)

Solution (Python):
a,b=map(int,input().split())
ans=str()
cnt=0
if a==b:
    while(cnt<b):
        ans+=str(b)
        cnt+=1
    print(ans)
    exit()

elif a>b:
    while(cnt<a):
       ans+=str(b)
       cnt+=1
    print(ans)
    exit()

else:
    while(cnt<b):
        ans+=str(a)
        cnt+=1
    print(ans)
    exit()

Solution (Python):
a,b = input().split()
print(min(a*int(b),b*int(a)))

Solution (Python):
a,b=map(int,input().split())
hoge=0.1111111111111111
if(a>b):
  print(b*int(hoge*10**a))
else:
  print(a*int(hoge*10**b))

Solution (Python):
a,b=map(int,input().split())
print(str(a)*b) if a<=b else print(str(b)*a)

Solution (Python):
a,b = map(int,input().split())
s = ''
if a> b:
    for i in range(a):
        s = s+str(b)
else:
    for i in range(b):
        s = s+str(a)
print(s)

Solution (Python):
a,b = map(str,input().split())
lst = [a*int(b),b*int(a)]
new = sorted(lst)
print(new[0])

Solution (Python):
a, b = input().split()
a, b = a * int(b), b * int(a)
print([a, b][a >= b])

Solution (Python):
A = list(map(int, input().split()))
a = str(A[0])
b = str(A[1])
list=[]
for i in range(A[1]-1):
  a += str(A[0])
list.append(a)
  
for i in range(A[0]-1):
  b += str(A[1])
list.append(b)

print(sorted(list)[0])

Solution (Python):
def main():
    x, y = [int(i) for i in input().split()]
    if x > y:
        print(str(y) * x)
    elif x < y:
        print(str(x) * y)
    else:
        print(str(x) * y)
main()

Solution (Python):
a, b = map(int, input().split())

if a < b:
  print(str(a)*b)
else:
  print(str(b)*a)

Solution (Python):
a, b = map(int, input().split())
print(str(min(a, b)) * max(a,b))

Solution (Python):
a,b = map(int,input().split())

if a>=b:
    print(str(b)*a)

else:
    print(str(a)*b)

Solution (Python):
a,b = map(str,input().split())
a1 = a*int(b)
b1 = b*int(a)
print(min(a1,b1))

Solution (Python):
a, b = map(int, input().split())

ca = ""
cb = ""

for i in range(a):
    ca += str(b)

for i in range(b):
    cb += str(a)

print(min(ca, cb))

Solution (Python):
a, b = input().split()
a = int(a)
b = int(b)

print(str(min(a,b))*max(a,b))

Solution (Python):
a,b=map(str,input().split())

ans1=''
for _ in range(int(b)):
  ans1+=a
ans2=''
for _ in range(int(a)):
  ans2+=b
ans=[ans1,ans2]
ans.sort()
print(ans[0])

Solution (Python):
a,b=map(int,input().split())
print(str(min(a,b))*max(a,b))

Solution (Python):
a, b = map(int, input().split())
ans = ''
if(a > b):
  for i in range(a):
    ans += str(b)
else:
  for i in range(b):
    ans += str(a)
print(ans)

Solution (Python):
a,b = input().split()
if a < b:
  b = int(b)
  print(a*b)
elif a > b:
  a = int(a)
  print(b*a)
else:
  b = int(b)
  print(a*b)

Solution (Python):
a,b = map(int, input().split())

num1 = ''
num2 = ''

for i in range(a):
  num1 = num1 + (str(b))

for i in range(b):
  num2 = num2 + (str(a))

list = [num1,num2]

list.sort()
print(list[0])

Solution (Python):
a,b = map(int,input().split(" "))
if a == b:
    print(str(a) * a)
else:
    m = min(a,b)
    n = max(a,b)
    print(str(m) * n)

Solution (Python):
a,b=input().split()
print(sorted([a*int(b),b*int(a)])[0])

Solution (Python):
a, b = input().split()

if int(a) < int(b):
    print(a * int(b))
else:
    print(b * int(a))

Solution (Python):
a, b = input().split()

if a < b:
  print(a * int(b))
else:
  print(b * int(a))

Solution (Python):
a,b = map(str,input().split())

c = int(a * int(b))
d = int(b * int(a))

if int(a)==int(b):
    print(str(c))

elif int(a)<int(b):
    print(str(c))

else:
    print(str(d))

Solution (Python):



def main():
    a, b = input().split()
    print(sorted([a * int(b), b * int(a)])[0])


if __name__ == '__main__':
    main()

Solution (Python):
a,b=input().split()
if int(a)>=int(b):
    print(b*int(a))
else:
    print(a*int(b))

Solution (Python):
a,b=map(int,input().split())
print(str(a)*b if a<b else str(b)*a)

Solution (Python):


import sys
sys.setrecursionlimit(300000)


def solve(a: int, b: int):
    A = str(a) * b
    B = str(b) * a
    print(min(A, B))
    return

def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    a = int(next(tokens))  
    b = int(next(tokens))  
    solve(a, b)

if __name__ == '__main__':
    main()

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
mod2 = 998244353
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


def main():
    a,b = LS()

    return min(a,b) * int(max(a,b))


print(main())

Solution (Python):
a,b=sorted(input().split());print(a*int(b))

Solution (Python):
a,b=sorted(input().split());print("".join(a for i in range(int(b))))

Solution (Python):
a, b = map(int, input().split())
if a < b:
    a, b = b, a
print(str(b) * a)

Solution (Python):
a,b = sorted(input().split())
print(a * int(b))

Solution (Python):
a, b = map(int, input().split())

aa = ''.join([str(a) for i in range(b)])
bb = ''.join([str(b) for j in range(a)])

lst = [aa, bb]
print(sorted(lst)[0])

Solution (Python):
a,b = map(int,input().split())
ans = [str(a)*b,str(b)*a]
ans.sort()
print(ans[0])

Solution (Python):
a, b = list(map(int, input().split()))

if a < b:
  print(str(a)*b)
else:
  print(str(b)*a)

Solution (Python):
import sys
input = sys.stdin.readline

a,b = map(int,input().split())

ans  = ''
if(a<b):
	for i in range(b):
		ans += str(a)
else:
	for i in range(a):
		ans += str(b)
print(ans)

Solution (Python):


a, b = list(map(int,input().split()))
A = [str(a) for i in range(b)]
B = [str(b) for i in range(a)]
A = ''.join(A)
B = ''.join(B)
print(min(A,B))

Solution (Python):
x,y=map(int,input().split())
print(str(min(x,y))*max(x,y))

Solution (Python):
from sys import stdin
a, b = stdin.readline().rstrip().split()
A = a*int(b)
B = b*int(a)
if A <= B:
    print(A)
else:
    print(B)

Solution (Python):
a = list(map(int,(input().split())))
m=a[0]
n=a[1]
if(m>=n):
	print(str(n)*m)
else:
	print(str(m)*n)

Solution (Python):
a,b=map(int,input().split())
aa=0
bb=0
for i in range(b):
  aa+=a*(10**i)
for i in range(a):
  bb+=b*(10**i)

ans=max(aa,bb)

print(ans)

Solution (Python):
a,b=map(int,input().split())
if a==b:
    print(str(a)*b)
else:
    print(str(min(a,b))*max(a,b))

Solution (Python):
def main():
    a, b = map(int, input().split())

    print(str(min(a, b)) * max(a, b))


if __name__ == '__main__':
    main()

Solution (Python):
def get_smaller():
    N, M = input().split(" ")

    smaller = N if N < M else M
    bigger = M if N < M else N

    rst = ""
    for _ in range(int(bigger)):
        rst += smaller
    print(rst)

get_smaller()

Solution (Python):
a,b=input().split()
a_string=a*int(b)
b_string=b*int(a)
answer=sorted([a_string,b_string])
print(answer[0])

Solution (Python):
def main():
  a,b = map(int,input().split())
  ans = check(a,b)
  print(ans)
  
def check(n,m):
    num = ""
    if n < m:
        for i in range(m):
            num = str(num) + str(n)
        return num
    elif n > m:
        for i in range(n):
            num = str(num) + str(m)
        return num
    else:
        for i in range(n):
            num = str(num) + str(m)
        return num

main()

Solution (Python):
a, b = input().split()

a_string = a * int(b)
b_string = b * int(a)

output = sorted([a_string, b_string])
print(output[0])

Solution (Python):
import sys
input = sys.stdin.readline

def main():
    n = list(map(int, input().split()))
    if n[0] > n[1]:
        n[0], n[1] = n[1], n[0]
    ans = 0
    for i in range(n[1]):
        ans += n[0] * 10**i
    print(ans)
main()

Solution (Python):
a, b = map(int, input().split())
s = ''
if a>b:
  for _ in range(a):
    s += str(b)
elif a<=b:
  for _ in range(b):
    s += str(a)
print(s)

Solution (Python):


a, b = input().split(' ')

a_ = a * int(b)
b_ = b * int(a)

if a_ <= b_:
    print(a_)
elif b_ <= a_:
    print(b_)

Solution (Python):
s = list(map(int,input().split()))
a = s[0]
b = s[1]
c = 0
if a < b:
    for i in range(b):
        c = c + (10**i) * a
else:
    for i in range(a):
        c = c + (10**i) * b
print(c)

Solution (Python):
a, b = map(str, input().split())
print(min (a * int(b), b * int(a)))

Solution (Python):
a,b=map(int,input().split())
c = a*str(b)
d = b*str(a)
if c < d :
    print(str(c))
else :
    print(str(d))

Solution (Python):
a, b = map(int, input().split())
s = str(a) * b
t = str(b) * a
print(min(s, t))

Solution (Python):
a,b=map(int,input().split())
print(str(a)*b if a<b else str(b)*a)

Solution (Python):
a,b=map(int, input().split())
if a>b:
  print(str(b)*a)
elif b<a:
  print(str(a)*b)
else:
  print(str(a)*b)

Solution (Python):
def printlexsmaller(n,m):
  str1 = "".join([str(n) for x in range(m)])
  str2 = "".join([str(m) for x in range(n)])
  return str1 if str1 < str2 else str2

input = list(map(int, input().rstrip().split()))
print(printlexsmaller(*input))

Solution (Python):
a, b = map(int, input().split())
print(str(min(a, b)) * max(a, b))

Solution (Python):
a,b = map(int, input().split())
ans = 0
if b>=a:
  for i in range(b):
    ans += a*(10**i)
  print(ans)
else:
  for j in range(a):
    ans += b*(10**j)
  print(ans)

Solution (Python):
a,b=map(int,input().split())
ta,tb=str(a)*b,str(b)*a
print(ta if ta < tb else tb)

Solution (Python):
a, b = map(int, input().split())
if a > b:
  for i in range(a):
    print(str(b), end='')
  exit()
elif a <= b:
  for i in range(b):
    print(str(a), end='')
  exit()

Solution (Python):
txt = input().split(' ')
a = txt[0]*int(txt[1])
b = txt[1]*int(txt[0])
ans = sorted([a,b])
print(ans[0])

Solution (Python):
a,b=map(str,input().split())
if((int(b)*a)<(int(a)*b)):
    print(int(b)*a)
else:
    print(int(a)*b)

Solution (Python):
a,b=map(str,input().split())
print(min(a,b)*int(max(a,b)))

Solution (Python):
a,b = map(int,input().split())
if a<b:
    print(str(a)*b)
else:
    print(str(b)*a)

Solution (Python):
a, b = input().split()

A = a * int(b)
B = b * int(a)

print(min(A,B))

Solution (Python):
a, b = map(int, input().split())
word = ''
res_word = ''
i = 0
if a <= b:
    word = str(a)
    i = b
else:
    word = str(b)
    i = a

for j in range(0, i):
    res_word += word

print(res_word)

Solution (Python):
a, b = input().split()
if a >= b:
  print(b * int(a))
elif b > a:
  print(a * int(b))

Solution (Python):
def solve(a, b):
    return min(str(a)*b, str(b)*a)

a, b = map(int, input().split())
print(solve(a, b))

Solution (Python):
import sys
import socket

hostname = socket.gethostname()

if hostname == 'F451C':
    sys.stdin = open('a1.in')


def read_int_list():
    return list(map(int, input().split()))


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    a, b = read_int_list()
    if a > b:
      res = str(b) * a
    else:
      res = str(a) * b
    print(res)


main()

Solution (Python):
a, b = map(int, input().split())

s = ""
if a > b:
    for i in range(a):
        s += str(b)
elif b > a:
    for i in range(b):
        s += str(a)
else:
    for i in range(b):
        s += str(a)
print(s)

Solution (Python):
n, m = map(int, input().split())
str_1 = ""
str_2 = ""
list_1 = []
for i in range(m):
  str_1 += str(n)
list_1.append(str_1)
for i in range(n):
  str_2 += str(m)
list_1.append(str_2)
sort_list = sorted(list_1)
print(sort_list[0])

Solution (Python):
a,b = input().split()
print(a*int(b)) if (a*int(b) < b*int(a)) else print(b*int(a))

Solution (Python):
import sys

def main():
  a, b = map(int, sys.stdin.readline().split())
  s = str(b)
  s1 = s*a
  s = str(a)
  s2 = s * b
  print(s1) if s1 <= s2 else print(s2)
if __name__ == "__main__":
  main()

Solution (Python):
a, b = map(int, input().split())
print(sorted([str(a)*b, str(b)*a])[0])

Solution (Python):



def main():
  a, b = map(int, input().strip().split())
  if a > b:
    a, b = b, a
  print(str(a)*b)

if __name__=='__main__':
  main()

Solution (Python):
a,b=map(int,input().split())
if a>b:
    print(a*str(b))
elif a<=b:
    print(str(a)*b)

Solution (Python):
a=list(map(lambda x:x,input().split()))
if(a[1]>a[0]):
  print(a[0]*int(a[1]))
else:
  print(a[1]*int(a[0]))

Solution (Python):


a,b = map(int, input().split())

if a <= b:
    print(str(a) * b)
else:
    print(str(b) * a)

Solution (Python):

import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
a,b = map(int,input().split())
if a <= b:
 	print(str(a)*b)
else: print(str(b)*a)

Solution (Python):
a,b = map(int,input().split())


A = str(a)
B = str(b)

c =""
d=""

for i in range(b):
    c = c+A;

for i in range(a):
    d = d+B
    
if c > d:
    print(d)
else:
    print(c)

Solution (Python):
a, b = map(int, input().split())

print(min(str(a) * b, str(b) * a))

Solution (Python):
a, b = input().split()
an, bn = map(int, [a, b])

aa = a * bn
bb = b * an

if aa > bb:
    print(bb)
else:
    print(aa)

Solution (Python):
import sys

def main():
  a, b = map(int, sys.stdin.readline().split())
  s = str(b)
  s1 = s*a
  s = str(a)
  s2 = s * b
  print(s1) if s1 <= s2 else print(s2)
if __name__ == "__main__":
  main()

Solution (Python):
a, b = map(int, input().split())


min_val = min([a, b])
str_len = max([a, b])

for i in range(str_len):
    print(str(min_val), end="")
print()

Solution (Python):
a = list(map(int, input().split()))
list = []

if a[0] >= a[1]:
  for i in range(a[0]):
    list += str(a[1]) 
else:
  for i in range(a[1]):
    list += str(a[0]) 
    
print(''.join(list))

Solution (Python):
a, b = map(int, input().split())
if a < b:
    print(str(a) * b)
else:
    print(str(b) * a)

Solution (Python):
s,t=map(int,input().split())
x=str(s)*t
y=str(t)*s
a=[x,y]
a.sort()
print(a[0])

Solution (Python):
a,b = map(int,input().split())
print(str(min(a,b))*max(a,b))

Solution (Python):
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations,groupby
import sys
import bisect
import string
import math
import time
import random
def S_():
    return input()
def LS():
    return [i for i in input().split()]
def I():
    return int(input())
def MI():
    return map(int,input().split())
def LI():
    return [int(i) for i in input().split()]
def LI_():
    return [int(i)-1 for i in input().split()]
def NI(n):
    return [int(input()) for i in range(n)]
def NI_(n):
    return [int(input())-1 for i in range(n)]
def StoI():
    return [ord(i)-97 for i in input()]
def ItoS(nn):
    return chr(nn+97)
def LtoS(ls):
    return ''.join([chr(i+97) for i in ls])
def GI(V,E,Directed=False,index=0):
    org_inp=[]
    g=[[] for i in range(n)]
    for i in range(E):
        inp=LI()
        org_inp.append(inp)
        if index==0:
            inp[0]-=1
            inp[1]-=1
        if len(inp)==2:
            a,b=inp
            g[a].append(b)
            if not Directed:
                g[b].append(a)
        elif len(inp)==3:
            a,b,c=inp
            aa=(inp[0],inp[2])
            bb=(inp[1],inp[2])
            g[a].append(bb)
            if not Directed:
                g[b].append(aa)
    return g,org_inp
def bit_combination(k,n=2):
    rt=[]
    for tb in range(n**k):
        s=[tb//(n**bt)%n for bt in range(k)]
        rt+=[s]
    return rt
def show(*inp,end='\n'):
    if show_flg:
        print(*inp,end=end)
YN=['Yes','No']
mo=10**9+7
inf=float('inf')
l_alp=string.ascii_lowercase
u_alp=string.ascii_uppercase
ts=time.time()
sys.setrecursionlimit(10**5)
input=lambda: sys.stdin.readline().rstrip()

def ran_input():
    import random
    n=random.randint(4,16)
    rmin,rmax=1,10
    a=[random.randint(rmin,rmax) for _ in range(n)]
    return n,a

show_flg=False
show_flg=True

ans=0


ans=0

n,m=LI()
a=str(n)*m
b=str(m)*n
if a>b:
    a=b
print(a)

Solution (Python):
a,b = map(int,input().split())

k = str(a)*b
l = str(b)*a

if k < l:
    print(k)
elif k > l:
    print(l)
else:
    print(k)

Solution (Python):
a,b = map(int,input().split())

if a>b:
    print(str(b)*a)

else:
    print(str(a)*b)

Solution (Python):
a, b = map(int, input().split())
print(min(str(a) * b, str(b) * a))

Solution (Python):
a, b = map(int,input().split())

if a < b:
  print(str(a)*b)

else:
  print(str(b)*a)

Solution (Python):
a, b = map(int, input().split())

A = ''.join([str(a)] * b)
B = ''.join([str(b)] * a)

if A <= B:
    print(A)
else:
    print(B)

Solution (Python):
a,b=map(int,input().split())
print(str(min(a,b))*max(a,b))

Solution (Python):

a,b = map(int,input().split())
if (a>b):
    a,b = b,a
print (str(a)*b)

Solution (Python):
a, b = input().split()
if a * int(b) < b * int(a):
    print(a * int(b))
else:
    print(b * int(a))

Solution (Python):
x = sorted(input().split())
print(x[0] * int(x[1]))

Solution (Python):
a,b = map(str, input().split())
if a > b:
    print(int(a)*b)
else:
    print(int(b)*a)