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 = input().split()
print(min(a*int(b), b*int(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())
n=''
if a>b:
    for i in range(a):
        n=n+str(b)
    print(int(n))
else:
    for i in range(b):
        n=n+str(a)
    print(int(n))

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

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

Solution (Python):



def solve(*args: str) -> str:
    a, b = map(int, args[0].split())
    ans, _ = sorted([str(a)*b, str(b)*a]) 
    return ans


if __name__ == "__main__":
    print(solve(*(open(0).read().splitlines())))

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


if __name__ == '__main__':
    main()

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

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

s1 = ''
for i in range(ab[1]):
  s1+= str(ab[0])

s2 = ''
for i in range(ab[0]):
  s2+= str(ab[1])

sa = sorted([s1, s2])

print(sa[0])

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

if a<b:
    print(str(a)*b)
elif a>b:
    print(str(b)*a)
else:
    print(str(a)*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 = input().split()

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

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

ans_1 = [a for _ in range(b)]
ans_1 = "".join(map(str, ans_1))
ans_2 = [b for _ in range(a)]
ans_2 = "".join(map(str, ans_2))

if ans_1 < ans_2:
    print(ans_1)
else:
    print(ans_2)

Solution (Python):
a,b=map(int,input().split())
x=min(a,b)
y=max(a,b)
ans=0
for i in range(y):
  ans+=x*(10**i)
print(ans)

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


if __name__ == "__main__":
    main()

Solution (Python):
a,b = map(int,input().split())
li = []
if a>b:
  for i in range(a):
    li.append(b)
  ans = ''.join(map(str, li))
  print(ans)
elif a<b:
  for i in range(b):
    li.append(a)
  ans = ''.join(map(str, li))
  print(ans)
elif a==b:
  for i in range(a):
    li.append(b)
  ans = ''.join(map(str, li))
  print(ans)

Solution (Python):
A,B=input().split()
ans = ["",""]

for i in range(int(B)):
  ans[0] = ans[0] + A
for i in range(int(A)):
  ans[1] = ans[1] + B

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

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

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

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

x=''
y=''

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

x=int(x)
y=int(y)

if x<y:
    print(y)
else:
    print(x)

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

ab = ''
ba = ''

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

for j in range(a):
    ba = ba + str(b)

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

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

Solution (Python):
import sys,queue,copy
sys.setrecursionlimit(10**8)
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
INF = float('inf')

n,m = inpl()
a = ""
b = ""
for i in range(m):
    a += str(n)

for j in range(n):
    b += str(m)

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

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

aa=""
bb=""

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

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

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

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

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

print( str(a) * b )

Solution (Python):
def main():
    a, b = input().split()
    A = a*int(b)
    B = b*int(a)
    ans = sorted([A, B])
    print(ans[0])


if __name__ == "__main__":
    main()

Solution (Python):
a, b = map(int, input().split())
m = min(a, b)
t = max(a, b)

ans = ""
for i in range(t):
  print(str(m), end="")

Solution (Python):
a,b=map(int,input().split())
ast=str(a)
bst=str(b)
for i in range(b-1):
    ast+=str(a)
for i in range(a-1):
    bst+=str(b)
alis=sorted([ast,bst])
print(int(alis[0]))

Solution (Python):
from sys import stdin

a, b = [int(x) for x in stdin.readline().rstrip().split()]

ans = ""

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

Solution (Python):

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

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

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

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

moji_a = str(a)*b
moji_b = str(b)*a

if moji_a < moji_b:
    print(moji_a)

else:
    print(moji_b)

Solution (Python):

def main():
    a,b = map(int,input().split())
    a_c = ord(str(a))
    b_c = ord(str(b))
    a_s = str(a) * b
    b_s = str(b) * a
    if a_c < b_c:
        answer = a_s
    elif a_c > b_c:
        answer = b_s
    else:
        answer = a_s if len(a_s) <= len(b_s) else b_s
    print(answer)


if __name__ == '__main__':
    main()

Solution (Python):
d = input().split(" ")
a = int(d[0])
b = int(d[1])
bc = d[0] * b
ac = d[1] * a
l = [ac, bc]
l.sort()
print(l[0])

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

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

Solution (Python):
N,M=map(int,input().split(" "))
ans = ""
if N<M:
    for i in range(M):
        ans += str(N)
    print(ans)
else:
    for i in range(N):
        ans += str(M)
    print(ans)

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

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

answer=0
for count in range(max(a,b)):
    answer*=10
    answer+=min(a,b)
print(answer)

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

a_value = str(a) * b
b_value = str(b) * a

x = sorted([a_value, b_value])[0]

print(x)

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

if a>b:
    for i in range(a):
        ans = ans*10 + b
if a<=b:
    for i in range(b):
        ans = ans*10 + a
        
print(ans)

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

l = a * int(b)
r = b * int(a)
 
l = int(l)
r = int(r)
 
if l > r:
    print(l)
else:
    print(r)

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

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

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

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

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

line_a = ""
line_b = ""
dict = []

for i in range(int(a)):
    line_a += b

for i in range(int(b)):
    line_b += a

dict.append(line_a)
dict.append(line_b)
dict.sort()

print(dict[0])

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

if A <= B:
  for i in range(B):
    Ans = Ans + str(A)

else:
  for j in range(A):
    Ans = Ans + str(B)

print(Ans)

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

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

    print(min(A, B))


if __name__ == "__main__":
    main()

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

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

Solution (Python):
a, b = map(int,input().split())
c = []
c.append(str(a)*b)
c.append(str(b)*a)

d = []
d = sorted(c)

print(int(d[0]))

Solution (Python):
import sys
def I(): return int(sys.stdin.readline())
def LI(): return [int(x) for x in sys.stdin.readline().split()]

def main():
    a,b = input().split()
    print(min(a,b)*int(max(a,b)))

if __name__ == "__main__":
    main()

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

b_new = ""
a_new = ""

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

Solution (Python):
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()

def main():
    a,b=map(int,input().split())
    A=str(a);B=str(b)
    N=min(len(A),len(B))
    ans=None
    for i in range(N):
        if int(A[i])>int(B[i]):
            ans='B'
            break
        elif int(B[i])>int(A[i]):
            ans='A'
            break
    else:
        if len(A)==N:
            ans=A
            z=b
        else:
            ans=B
            z=a
    if ans=='A':
        print(str(a)*b)
    elif ans=='B':
        print(B*a)
    else:
        print(ans*z)
    

if __name__ == '__main__':
    main()

Solution (Python):
a,b=map(int,input().split())
ab=0
ba=0
for i in range(b):
    ab+=a*(10**i)
for i in range(a):
    ba+=b*(10**i)
if a<b:
    print(ab)
elif b<a:
    print(ba)
else:
    print(min(ab,ba))

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

str1 = ""
str2 = ""

for i in range(int(b)):
    str1 += a

for i in range(int(a)):
    str2 += b

print(sorted([str1, str2])[0])

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

ansa=str(a)
ansb=str(b)

for i in range(b-1):
    ansa=ansa+str(a)
for i in range(a-1):
    ansb=ansb+str(b)

A=[]
A.append(ansa)
A.append(ansb)

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

Solution (Python):
N, M =map(int, input().split())

a = str(N)*M
b = str(M)*N
l = [a,b]
print(sorted(l)[0])

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

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

Solution (Python):
a,b=input().split()
A=[]
B=[]
for i in range(int(a)):
   B.append(b)
c="".join(B)

for i in range(int(b)):
   A.append(a)
d="".join(A)

E=[c,d]
E.sort()
print(E[0])

Solution (Python):
a,b=list(map(int,input().split()))
a_b=""
b_a=""
for _ in range(b):
    a_b += str(a)
    
for _ in range(a):
    b_a += str(b)

if a_b[0] <= b_a[0]:
    print(a_b)
else:
    print(b_a)

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

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

if int(A) > int(B):
    print(str(A))
else:
    print(str(B))

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

Solution (Python):
A,B = list(map(str,input().split()))
C = A * int(B)
D = B * int(A)
listA = [C,D]
listA.sort()
print(listA[0])

Solution (Python):
a,b = map(int,input().split())
if a>b:
    x = map(str,[b]*a)
    x2 = "".join(x)
    print(x2)
else:
    x = map(str,[a]*b)
    x2 = "".join(x)
    print(x2)

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

a = int(x[0])
b = int(x[1])

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

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

Solution (Python):
a, b = list(map(int,input().split()))
i = 0
if a > b:
  while i < a:
    print(b, end="")
    i = i + 1
else:
  while i < b:
    print(a, end="")
    i = i + 1

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

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

a1 = str(a)*b
b1 = str(b)*a

arr = [a1,b1]
arr.sort()
print(arr[0])

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

Solution (Python):
n, m = map(str, input().split())

tmp_list = []

str_1 = n * int(m)
str_2 = m * int(n)

tmp_list.append(str_1)
tmp_list.append(str_2)
print(sorted(tmp_list)[0])

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 = map(int, input().split())
s1 = str(a) * b
s2 = str(b) * a

if s1 < s2:
    print(s1)
elif s2 < s1:
    print(s2)
elif s1 == s2:
    print(s1)

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

lst = list()
la = ""
lb = ""

for i in range(0, b):
    lb = lb + str(a)
for i in range(0, a):
    la = la + str(b)

lst.append(la)
lst.append(lb)
lst.sort()

print(lst[0])

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

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

A = [a for _ in range(int(b))]
B = [b for _ in range(int(a))]

A = ''.join(A)
B = ''.join(B)
list_ = sorted([A, B])
print(list_[0])

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

print(sorted(ans_l)[0])

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

c = min(a, b)
d = max(a, b)
print(str(c) * d)

Solution (Python):
n,m = map(str,input().split())

a = n*int(m)
b = m*int(n)
if a >= b:
  print(b)
else:
  print(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())

ans = ["", ""]
for i in range(a):
    ans[0] += str(b)
for i in range(b):
    ans[1] += str(a)

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

Solution (Python):
a,b=map(int,input().split())
p=0
for i in range(max(a,b)):
    p = p+min(a,b)*(10**i)
print(p)

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

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

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())
ab = str(a)*b
ba = str(b)*a
if a>b:
  print(ba)
else:
  print(ab)

Solution (Python):
N,M = map(int, input().split())

print(str(min(N,M)) * max(N,M))

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

Solution (Python):

import sys
input = sys.stdin.readline

a,b = list(map(int,input().split()))
a_s ,b_s = list(map(str,[a,b]))

ret_list = [a_s * b,b_s * a]
ret_list.sort()
print(ret_list[0])

Solution (Python):
a,  = [list(map(int, s.split())) for s in open(0)]

mi = min(a)
ma = max(a)

s = ""
for i in range(ma):
    s += str(mi)
print(s)

Solution (Python):
import sys

read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
inputs = sys.stdin.buffer.readlines








def main():
	a,b=map(int,input().split())
	c=min(a,b)
	d=max(a,b)
	ans=str(c)*d
	print(ans)


if __name__ == "__main__":
	main()

Solution (Python):

A,B=map(int,input().split())


mini=min(A,B)
deca=max(A,B)
answer=""

for i in range(deca):
    answer+=str(mini)

print(answer)

Solution (Python):
a,b=map(int, input().split())
v=[str(min(a,b)) for i in range(max(a,b))]

print(''.join(v))

Solution (Python):
a,b=input().split()
A=[]
c=a*int(b)
d=b*int(a)
A.append(c)
A.append(d)
A.sort()
print(A[0])

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

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

Solution (Python):

a, b = map(str, input().split())
x = ''
for i in range(int(b)):
    x = x + a
y = ''
for i in range(int(a)):
    y = y + b
if x < y:
    print(x)
else:
    print(y)

Solution (Python):
a = raw_input().split(" ")
 
l1 = a[0]*int(a[1])
l2 = a[1]*int(a[0])

if l1 < l2:
  print(l1)
else:
  print(l2)

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

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

if c < d:
    print(c)

else:
    print(d)

Solution (Python):

def main():
    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)


if __name__ == '__main__':
    main()

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

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

Solution (Python):
a,b = input().split()
r_a = ""
r_b = ""
for _ in range(int(b)):
    r_a = r_a + a
for _ in range(int(a)):
    r_b = r_b + b
print(min(r_a,r_b))

Solution (Python):
import sys


def main():
    tmp = input().split(" ")
    n = int(tmp[0])
    m = int(tmp[1])
    tmp = ""
    if n > m:
        for i in range(n):
            tmp += str(m)
    else:
        for i in range(m):
            tmp += str(n)
    print(tmp)


if __name__ == '__main__':
    input = sys.stdin.readline
    main()

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

print(min(N,M) * int(max(N, M)))

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

s1 = ''
for i in range(int(a)):
    s1 += b

s2 = ''
for i in range(int(b)):
    s2 += a

if s1 <= s2:
    print(s1)
else:
    print(s2)

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

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

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

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

aa = a * int(b)
bb = b * int(a)

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

Solution (Python):
a,b = map(int, input().split())
sa = str(a)
sb = str(b)
sc = sa * b
sd = sb * a

if sc < sd:
    print(sc)
else:
    print(sd)

Solution (Python):
def solve(A, B):
  a_int = int(int(B) * A)
  b_int = int(B * int(A))

  print(max(a_int, b_int))

  
A, B = input().split()
solve(A, B)

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

if a < b:
    ans = str(a) * b
elif a > b:
    ans = str(b) * a
else:
    ans = str(a) * b

print(ans)

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

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

Solution (Python):



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

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

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

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

if int(a)>=int(b):
    print(ba)
else:
    print(ab)

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_ans = int(str(a)*b)
b_ans = int(str(b)*a)

if a_ans >= b_ans:
    print(a_ans)
else:
    print(b_ans)

Solution (Python):
a, b = input().split()
str = ''
if a < b:
    for _ in range(int(b)):
        str += a
else:
    for _ in range(int(a)):
        str += b


print(str)

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

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

if a<b:
  print(''.join([a]*int(b)))
else:
  print(''.join([b]*int(a)))

Solution (Python):

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

asum = 0
bsum = 0

for kk in range(b):
    asum = asum * 10 + a

for ll in range(a):
    bsum = bsum * 10 + b

if asum > bsum:
    print(asum)
else:
    print(bsum)

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

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

print(sorted([ab, ba])[0])

Solution (Python):
a, b = (int(i) for i in input().split())
ans = ""
if(a < b):
    for i in range(b):
        ans = ans + str(a)
else:
    for i in range(a):
        ans = ans + str(b)

print(ans)

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())
c = str(a)*b
d = str(b)*a
arr =[c,d]
print(sorted(arr)[0])

Solution (Python):


b,c=map(int,input().split())
bc=c
cb=b
for i in range(b-1):
    bc=(bc*10+c)
for i in range(c-1):
    cb=(cb*10+b)
print(max(bc,cb))

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

ans1 = a
ans2 = b
if a >= b:
  ans1 = b
  ans2 = a

temp = ''
for i in range(ans2):
  temp += str(ans1)
print(temp)

Solution (Python):
A = list(input().split())
a_list = []
a = ''
for i in range(int(A[0])):
    a += A[1]
a_list.append(a)
b = ''
for i in range(int(A[1])):
    b += A[0]
a_list.append(b)
a_list.sort(reverse=False)
print(a_list[0])

Solution (Python):




def pin(type=int):
    return map(type,input().split())
"""    
入力は以下の形式で標準入力から与えられる。

N  
x1　y1 N=0として。
xN　yN
"""
a,b= pin(str)
StrA = a*int(b)
StrB = b*int(a)
if StrA >= StrB:
    print(StrB)
else:
    print(StrA)

Solution (Python):

def main():
    a, b = [int(x) for x in input().split()]
    if a > b:
        small = str(b)
        big = a
    else:
        small = str(a)
        big = b
    for _ in range(big):
        print(small, end='')
    print()


if __name__ == "__main__":
    main()

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

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

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

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

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


if __name__ == '__main__':
    main()

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy,copy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

def main():
    a, b = MAP()
    A = str(a)*b
    B = str(b)*a
    li = [A, B]
    li.sort()
    print(li[0])


if __name__=='__main__':
    main()

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

if str_1 > str_2:
  print(str_2)
else:
  print(str_1)

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

a_str = a * int(b)
b_str = b * int(a)

if int(a) < int(b):
  print(a_str)
else:
  print(b_str)

Solution (Python):
import sys
input = sys.stdin.readline
a, b = map(int, input().split())
s = ""
if a > b:
    for _ in range(a):
        s += str(b)
else:
    for _ in range(b):
        s += str(a)
print(s)

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

a_4 = int(str(a)*b)

b_4 = int(str(b)*a)

if (a_4 > b_4):
    print(a_4)
else:
    print(b_4)

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 = map(int,input().split())
ans = str(min(a, b)) * max(a, b)
print(ans)

Solution (Python):
a, b = input().split()
x = [0]*2
x[0] = a*int(b)
x[1] = b*int(a)
x.sort()
print(x[0])

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

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

    string[0] = str(a) * b
    string[1] = str(b) * a

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


if __name__ == '__main__':
    main()

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

n1 = int(str(a)*b)
n2 = int(str(b)*a)

if a >= b:
  print(n2)
else:
  print(n1)

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

aa = str(a) * b
bb = str(b) * a
print(aa if aa < bb else bb)

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

s1 = ''
for i in range(int(a)):
    s1 += b

s2 = ''
for i in range(int(b)):
    s2 += a

if s1 <= s2:
    print(s1)
else:
    print(s2)

Solution (Python):
a,b=input().split()
c=int(a)
d=int(b)
acn=""
bcn=""
for i in range(d):
    acn+=a
for i in range(c):
    bcn+=b
if acn<=bcn:
    print(acn)
else:
    print(bcn)

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

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

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

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

char = ''
num = 0
result = ''

if a > b:
    char = str(b)
    num = a
else:
    char = str(a)
    num = b

for i in range(num):
    result = result + char
    
print(result)

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

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

Solution (Python):

N,M = input().split()
nN,mM = int(N), int(M)

NN = ''
MM = ''
for i in range(mM):
    NN += N
    
for i in range(nN):
    MM += M

x = [MM,NN]
x.sort()
print(x[0])

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

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

Solution (Python):

a,b = map(str,input().split())
ans_1 = a *int(b)
ans_2 = b *int(a)

if a >= b:
    print(ans_2)
else:
    print(ans_1)

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

Solution (Python):



test = ""

"""
4 3
ans
3333
"""

"""
9 3
ans
333333333
"""

test = list(reversed(test.strip().splitlines()))
if test:
    def input2():
        return test.pop()
else:
    def input2():
        return input()


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

print(sorted([str(a) * b, str(b) * a])[0])

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

a_ = "".join([a for _ in range(int(b))])
b_ = "".join([b for _ in range(int(a))])
print(sorted([a_, b_])[0])

Solution (Python):
n, m = map(int, input().split())
text = ""

if (n > m):
    for i in range(n):
        text += str(m)
elif (m > n):
    for i in range(m):
        text += str(n)
elif (n == m):
    for i in range(n):
        text += str(m)

print(text)

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

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

first = ""
for i in range(int(b)):
    first += a
last = ""
for i in range(int(a)):
    last += b

lst = sorted([first, last])

print(lst[0])

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

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

x = a*int(b)
y = b*int(a)

for i in range(min(len(x), len(y))):
  if int(x[i]) > int(y[i]):
    print(y)
    exit()
  elif int(x[i]) < int(y[i]):
    print(x)
    exit()
  else:
    continue
else:
  print(x)

Solution (Python):
a_s, b_s = input().split()
a_i = int(a_s)
b_i = int(b_s)

a,b = "",""
for _ in range(a_i):
  b += b_s
for _ in range(b_i):
  a += a_s

ans = []
ans.append(a)
ans.append(b)

ans.sort()

print(ans[0])

Solution (Python):
N, M = map(int, input().split())

if N <= M:
    for i in range(M):
        print(N, end='')
else:
    for i in range(N):
        print(M, end='')

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

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

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

X=""
for i in range(int(b)):
    X+=a
Y=""
for i in range(int(a)):
    Y+=b


if X>Y:
    print(Y)
else:
    print(X)

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

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

Solution (Python):
a, b = map(int, input().split())
k = min(a, b)
kk = max(a, b)
lis = [k]*kk
print(*lis, sep="")

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

if(a>=b): print(B)
else: print(A)

Solution (Python):
a, b = map(int, input().split())
ans = ""
if a-b < 0:
  for _ in range(b):
    ans += str(a)
else:
  for _ in range(a):
    ans += str(b)
print(ans)

Solution (Python):
k=input().split();
a=int(k[0])
b=int(k[1])
if(a>b):
 print(k[1]*a)
else:
 print(k[0]*b)

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())

mx = max(a,b)
mn = min(a,b)
ans = ''
for i in range(mx):
  ans += str(mn)
print(ans)

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

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

aa = ''.join([a for _ in range(int(b))])
bb = ''.join([b for _ in range(int(a))])

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

Solution (Python):
n,m =map(int,input().split())

if n<m:
  print(str(n)*m)
else:
  print(str(m)*n)

Solution (Python):
a, b = map(int, input().split())
S = str(min(a, b))
S_list= "".join([S]*max(a, b))
print(S_list)

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

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


ab = ''.join((str(a) for x in range(b)))
ba = ''.join((str(b) for x in range(a)))

if str(ab) > str(ba):
  print(ba)
else:
  print(ab)

Solution (Python):
def main():
    a, b = map(int, input().split(" "))
    smaller = min(a, b)
    bigger = max(a, b)
    print(str(smaller) * bigger)


if __name__ == '__main__':
    main()

Solution (Python):
import sys
A, B = [int(v) for v in input().split()]

sAB = ''
for i in range(B):
    sAB += str(A)

sBA = ''
for i in range(A):
    sBA += str(B)


if sAB > sBA:
    print(sBA)
else:
    print(sAB)

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

if (A < B):
    i = 0
    while True:
        i+=1
        print(A, end="")
        if (B == i):
            break

else:
    i = 0
    while True:
        i += 1
        print(B, end="")
        if (A == i):
            break

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

Solution (Python):
a,b=input().split()
x=a*int(b)
y=b*int(a)
l=[x,y]
l.sort()
print(l[0])

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

Solution (Python):
a, b = map(int, input().split())
c = max(a,b)
d = min(a,b)
e = 0
for i in range(c):
  e += d*(10**i)
print(e)

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

Solution (Python):
a_b = list(map(lambda x: int(x), input().split(" ")))
if a_b[0] >= a_b[1]:
    x = a_b[0]
    y = a_b[1]
else:
    x = a_b[1]
    y = a_b[0]

print(str(y)*x)

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())

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

Solution (Python):
N, M = map(int, input().split())

if N >= M:
  print(str(M)*N)
else:
  print(str(N)*M)