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(int, input().split())
if a < b:
    print(''.join(map(str, [a for _ in range(b)])))
else:
    print(''.join(map(str, [b for _ in range(a)])))

Solution (Python):
if __name__ == '__main__':
    b, c = map(int, input().split())
    b1 =""
    c1 = ""
    for i in range(c):
        b1 = b1 + str(b)

    for i in range(b):
        c1 = c1 + str(c)

    if int(b) < int(c):
        print(b1)
    else:
        print(c1)

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

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

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

	

if __name__ == '__main__':
	main()

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

if a<b:
    print(A*b)
else:
    print(B*a)

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(B)
else:
  print(A)

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

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

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

m = max(ab, ba)

print(str(m))

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

Solution (Python):
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def my_round(a,dig=0): 
    p = 10 ** dig
    return (a * p * 2 + 1) // 2 / p

def round_up(a): 
    return int(a + 0.9)

def gcd(a,b): 
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

def lcm(a,b): 
    return a/gcd(a,b)*b

def divisors(a): 
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): 
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): 
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): 
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

def main():
    a,b = map(int,input().split())
    ans = []
    if a < b:
        for i in range(b):
            ans.append(str(a))
    else:
        for i in range(a):
            ans.append(str(b))
    print(''.join(ans))
    return

if __name__=='__main__':
    main()

Solution (Python):
a,b = map(int,input().split())
ansa = ""
ansb = ""
for i in range(a):
    ansb +=str(b)
for i in range(b):
    ansa +=str(a)
print(min(ansa,ansb))

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

txt1 = a * int(b)
txt2 = b * int(a)

print(sorted([txt1, txt2])[0])

Solution (Python):

ab=input().split(" ")
a=ab[0]
b=ab[1]

c1=""
for n in range(int(b)):
    c1=c1+a

c2=""
for n in range(int(a)):
    c2=c2+b

print(min(c1,c2))

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

Solution (Python):
int_a, int_b = map(int, input().split())

if int_a>=int_b:
    print(str(int_b)*int_a)
else :
    print(str(int_a)*int_b)

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

ans_a = ""
ans_b =""
for i in range(a):
    ans_a += str(b)
for j in range(b):
    ans_b += str(a)
    
ans_list = [ans_a,ans_b]
ans_list.sort()

print(ans_list[0])

Solution (Python):
def LI():
  return [int(s) for s in input().split()]
a,b = LI()

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

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

repetitionA = ""
repetitionB = ""

for i in range(int(ab[1])):
    repetitionA += ab[0]

for j in range(int(ab[0])):
    repetitionB += ab[1]

if (int(repetitionA) > int(repetitionB)):
    print(repetitionA)
else:
    print(repetitionB)

Solution (Python):


''' 
------------------------
author : iiou16
------------------------
'''

def main():
    a, b = input().split()

    aa = "".join([a] * int(b))
    bb = "".join([b] * int(a))

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


if __name__ == '__main__':
    main()

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

alist = str(a)*b
blist = str(b)*a
result=[alist, blist]
print(min(result))

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

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

P = A*int(B)
Q = B*int(A)

if A<B:
    print(P)

else:
    print(Q)

Solution (Python):

"""
Created on Sun Jan 19 20:54:58 2020

@author: over-
"""

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

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

Solution (Python):
N,M = map(int,input().split())
N_str = ""
M_str = ""
for m in range(M):
    N_str += str(N)
for n in range(N):
    M_str += str(M)
print(min(N_str,M_str))

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

Solution (Python):
a, b = map(int, input().split())
string = []
strA = ""
strB = ""
for i in range(b):
    strA = strA + str(a)
string.append(strA)
for i in range(a):
    strB = strB + str(b)
string.append(strB)
string.sort()
print(string[0])

Solution (Python):
num = list(map(int,input().split()))
x = min(num)
y = max(num)

print(str(x) * y)

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

g=a*int(b)
h=b*int(a)
if g<=h:
  print(g)
else:
  print(h)

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

an = int(a)
bn = int(b)

print(sorted([a*bn, b*an])[0])

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

s_a = str(a) * b
s_b = str(b) * a

if a >= b:
    print(s_b)

else:
    print(s_a)

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

for i in range(int(a)):
    s2.append(b)
s1 = "".join(s1)
s2 = "".join(s2)

if s1 > s2:
    print(s2)
else:
    print(s1)

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

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

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

aa=[]
bb=[]

for i in range(a):
    aa.append(str(b))

for i in range(b):
    bb.append(str(a))

str1="".join(aa)
str2="".join(bb)

result=[str1,str2]

result=sorted(result)

print(result[0])

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

ans = min(a * int(b), b * int(a))
print(ans)

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

if a<=b:
    A = "".join([str(a)]*b)
    print(A)
else:
    B = "".join([str(b)]*a)
    print(B)

Solution (Python):
A,B = map(int,input().split())
a = str(A)
b = str(B)
ans =""
if A > B:
  for i in range(A):
    ans += b
else:
  for i in range(B):
    ans += 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):
ab = input().split(' ');
a = int(ab[0]);
b = int(ab[1]);

if a >= b :
	for i in range(a) :
		print(b,end='');
elif a < b :
	for i in range(b) :
		print(a,end='');

print('');

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

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

newa = str(a)*b
newb = str(b)*a

list = newa,newb
list = sorted(list)
print(list[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=(int(x) for x in input().split())
ab=str(str(a)*b)
ba=str(str(b)*a)
print(min(ab,ba))

Solution (Python):
def mainFunc():
    a, b = list(map(int, input().split(" ")))
    if a <= b:
        mn = a
        mx = b
    else:
        mn = b
        mx = a
    
    ans = ""
    for i in range(mx):
        ans += str(mn)
    
    print(ans)

mainFunc()

Solution (Python):
a,b = map(int,input().split())
ans = ""
for i in range(max(a,b)):
  ans = ans+str(min(a,b))
print(ans)

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

b = t.pop()
a = t.pop()

if a < b:
    print("{}".format(str(a)*b))
else:
    print("{}".format(str(b)*a))

Solution (Python):
a, b = (int(x) for x in 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())
s = ""
t = ""
for i in range(b):
    s += str(a)
for i in range(a):
    t += str(b)

if a >= b:
    print(t)
else:
    print(s)

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

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

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

if (a <= b):
    print("".join([str(a) for i in range(b)]))
else:
    print("".join([str(b) for i in range(a)]))

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

lis = [A, B]
new_lis = sorted(lis)
print(new_lis[0])

Solution (Python):
n=list(map(int,input().split()))
ans=0
m=max(n)
s=min(n)
for i in range(m):
  ans+=s*10**i
print(ans)

Solution (Python):
import sys
input = sys.stdin.readline
def print_ans(a, b):
    """Test Case
    >>> print_ans(4, 3)
    3333
    >>> print_ans(7, 7)
    7777777
    """
    if a > b:
        print(str(b) * a)
    else:
        print(str(a) * b)


if __name__ == '__main__':
    a, b = map(int, input().rstrip().split())
    print_ans(a, b)

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

strA = ''
strB = ''

for i in range(intB):
    strA += a

for j in range(intA):
    strB += b

if strA < strB:
    print(strA)
elif strB <= strA:
    print(strB)

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

ans1 = str()
for i in range(0,b):
  ans1 += str(a)
ans2 = str()
for i in range(0,a):
  ans2 += str(b)


if ans1<ans2:
  print(ans1)
else:
  print(ans2)

Solution (Python):
a, b=input().split()
sa=''
sb=''
for i in range(int(b)):
  sa+=a
for i in range(int(a)):
  sb+=b

if sa < sb: print(sa)
else: print(sb)

Solution (Python):
a,b= map(int, input().split())
MIN = min(a,b)
MAX = max(a,b)
answer = [MIN] * MAX


"".join(map(str,answer))
print(int("".join(map(str,answer))))

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

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


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

Solution (Python):
n,m = map(int,input().split())
j = ""
if(n>=m):
    for i in range(n):
        j += str(m)
    print(j)
else:
    for i in range(m):
        j += str(n)
    print(j)

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

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

for i in range(B):
	A_t += str(A)
for i in range(A):
	B_t += str(B)

if A_t < B_t:
	print(A_t)
else:
	print(B_t)

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

for i in range(b-1):
  stra = stra +str(a)
for i in range(a-1):
  strb = strb +str(b)

print(sorted([stra, strb])[0])

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

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

for i in range(a):
  ans2= ans2 + str(b)
  
list = []
list.append(ans1)
list.append(ans2)

list.sort()

print(list[0])

Solution (Python):
a,b=map(int,input().split())
A=""
B=""
for i in range(b):
    A+=str(a)
for j in range(a):
    B+=str(b)
if int(A)>=int(B):
    print(int(A))
else:
    print(int(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 = input().split()
a = int(a)
b = int(b)
string = ""
if a>b:
    for i in range(a):
        string = string+str(b)
elif b>a:
    for i in range(b):
        string = string+str(a)
else:
    for i in range(a):
        string =  string+str(a)
print(string)

Solution (Python):
a, b = raw_input().split(" ")

a = int(a)
b = int(b)

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

Solution (Python):


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

Solution (Python):
a,b = map(int,input().split())
S_a = S_b = ""
for i in range(b):
    S_a += str(a)
for j in range(a):
    S_b += str(b)

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

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

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

if(a > b):

    print(str(b)*a)

elif(a <= b):
    
    print(str(a)*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())
ptext = ""
if a <= b:
  for i in range(b):
    ptext += str(a)
if b < a:
  for i in range(a):
    ptext += str(b)
print(ptext)

Solution (Python):
a,b = input().split()
print(chr(min(map(ord, [a,b])))*int(chr(max(map(ord, [a,b])))))

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

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

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

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

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

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

if int(n) == int(m):
    print(str(n)*int(m))
elif int(n) > int(m):
    print(str(m)*int(n))
else:
    print(str(n)*int(m))

Solution (Python):
a, b = map(int, input().split())
temp = ''
loop = 0

if a < b:
  s = str(a)
  loop = b
else:
  s = str(b)
  loop = a

for _ in range(loop):
  temp += s
print(temp)

Solution (Python):
a,b = map(int, input().split())
n = 0
if a >= b:
  while(a != 0):
    a += -1
    n += b * (10**a)
else:
  while(b != 0):
    b += -1
    n += a * (10**b)
print(n)

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

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

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

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

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

Solution (Python):


import sys
import math
import time
import numpy as np
import collections
from collections import deque
import queue
import copy


def gcd(m,n):
  x = max(m,n)
  y = min(m,n)
  if x%y == 0:
    return y
  else:
    while x%y != 0:
      z = x%y
      x = y
      y = z
    else:
      return z


def bfs(SS, x, y, H, W):
  x_next = [0, 0, -1, 1]
  y_next = [1, -1, 0, 0]
  tempx = x
  tempy = y
  mlength = 0
  q = deque()
  xytuple = (x, y, 0)
  q.append(xytuple)


  while q:
    xytuple = q.popleft()
    SS[xytuple[0]][xytuple[1]] = "x" 
    for i in range(4): 
      tempx = xytuple[0] + x_next[i]
      tempy = xytuple[1] + y_next[i]
      
      
      if(0 <= tempx and tempx < H and 0 <= tempy and tempy < W and SS[tempx][tempy] == "."):
        temptuple = (tempx, tempy, xytuple[2]+1)
        SS[temptuple[0]][temptuple[1]] = "x" 
        mlength = max(mlength, xytuple[2] +1)
        q.append(temptuple)
      
  return mlength



ab = str(input()).split()
a = int(ab[0])
b = int(ab[1])
A = ab[0]
B = ab[1]
C = ""
D = ""



for i in range(a):
  C += B

for i in range(b):
  D += A

if(A>B):
  print(C)
elif(A<B):
  print(D)
else:
  print(D)

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

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

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

word_a = a * int(b)
word_b = b * int(a)

word_list = [word_a, word_b]
word_list.sort()
print(word_list[0])

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

astr = ''
bstr = ''

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

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

if astr > bstr:
    print(bstr)
elif astr < bstr:
    print(astr)
else:
    print(astr)

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

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

if a >= b:
    for i in range(a):
        print(b, end="")

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

Solution (Python):
import sys
input = sys.stdin.readline
def print_ans(a, b):
    """Test Case
    >>> print_ans(4, 3)
    3333
    >>> print_ans(7, 7)
    7777777
    """
    if a > b:
        print(str(b) * a)
    else:
        print(str(a) * b)


if __name__ == '__main__':
    a, b = map(int, input().rstrip().split())
    print_ans(a, b)

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

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

print(min([ab,ba]))

Solution (Python):
a,b=input().split()
a_int=int(a)
b_int=int(b)
n1=int(a*b_int)
n2=int(b*a_int)
if a_int==b_int:
    print(n1)
if a_int<b_int:
    print(n1)
if a_int>b_int:
    print(n2)

Solution (Python):




def solve(A, B):
    AA = ''
    for b in range(B):
        AA += str(A)

    BB = ''
    for a in range(A):
        BB += str(B)
    ans = sorted([AA, BB])
    return ans[0]




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









print(solve(A, B))

Solution (Python):

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

x = ''.join([str(a) for _ in range(0, b)])
y = ''.join([str(b) for _ in range(0, a)])

z = [x,y]
z.sort()
print(z[0])

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

print(str(n) * m)

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)*a)

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

a_s = str(a_s)
b_s = str(b_s)

print(min(a_s,b_s))

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

Solution (Python):

a, b = input().split()
aaa = a * int(b)
bbb = b * int(a)
if aaa > bbb:
    print(bbb)
elif aaa < bbb:
    print(aaa)
elif aaa == bbb:
    print(aaa)

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

t = 0
s = 0
if a > b:
    t = b
    s = a
else:
    t = a
    s = b

r = ''
for i in range(s):
    r += str(t)
print(r)

Solution (Python):

import sys


def solve(a: int, b: int):
    c=[]
    d=[]
    for i in range(int(a)):
        c.append(b)
    for i in range(int(b)):
        d.append(a)
    ans="".join(min(c,d))
    print(ans)


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

if __name__ == '__main__':
    main()

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

def create_str(n, count):
    return str(n) * count

if a == b:
    print(create_str(a, b))
elif a > b:
    print(create_str(b, a))
else:
    print(create_str(a, b))

Solution (Python):
N,M=map(int, input().split())
st=""
if (N<=M):
    for _ in range(M):
        st="".join((st,str(N)))
    print(st)
else:
    for _ in range(N):
        st="".join((st,str(M)))
    print(st)

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

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

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

ss = [a_res, b_res] 
ss = sorted(ss)

print(ss[0])

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

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):
a1, b1 = map(int, input().split())
a2 = str(a1) * b1
b2 = str(b1) * a1
if int(a2[0]) > int(b2[0]):
    print(b2)
elif int(a2[0]) < int(b2[0]):
    print(a2)
else:
    print(a2)

Solution (Python):

 
import math
import itertools
import sys
import copy
 





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

x = ""
y = ""

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

if int(x) >= int(y) :
  print (int(x))
else :
  print (int(y))

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

for i in range(b):
  A.append(a)

for i in range(a):
  B.append(b)

if A <= B:
  print("".join(map(str, A)))

else:
  print("".join(map(str,B)))

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

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

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

s1 = ''
s2 = ''

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

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

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

Solution (Python):
a, b = [int(x) for x in input().split()]
A = str(a)*b
B = str(b)*a
print(sorted([A, B])[0])

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

print("{0}".format(a) * b if a < b else "{0}".format(b) * a)

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

    atimesb = str(a) * b
    btimesa = str(b) * a

    if len(atimesb) > len(btimesa):
        print(atimesb)
    elif len(atimesb) < len(btimesa):
        print(btimesa)
    else:

        for i in range(min(len(atimesb), len(btimesa))):
            if int(atimesb[i]) != int(btimesa[i]):
                if atimesb[i] < btimesa[i]:
                    print(atimesb)
                else:
                    print(btimesa)
                break
        else:
            print(atimesb)

if __name__ == '__main__':
    solve()

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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


mx = max(a, b)
mn = min(a, b)
print(str(mn) * mx)

Solution (Python):
import queue
import copy
import math
from collections import deque


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

small = min(a, b)
large = max(a, b)

s = ""
for i in range(0, large):
    s += str(small)

print(s)

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

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

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

for _ in range(int(a)):
    strb = strb + b
for _ in range(int(b)):
    stra = stra + a

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

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

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

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

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

if a*10**(b-1)>b*10**(a-1):
    for i in range(b):
        print(a,end="")
    print('\n')
else:
    for i in range(a):
        print(b,end="")
    print('\n')

Solution (Python):
if __name__=="__main__":
    a, b = map(int, input().split())
    if a <= b:
        lis=[a]*b
    else:
        lis=[b]*a

    s=""
    for i in range(len(lis)):
        s = s + str(lis[i])

    print(s)

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

list_a = [ str(n) for i in range(m)]
list_b = [ str(m) for i in range(n)]


if n < m:
    print(''.join(list_a))
else:
    print(''.join(list_b))

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

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

a_ = ''
b_ = ''

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

for j in range(int(a)):
    b_ = b_ + b

if a_ < b_:
    print(a_)
else:
    print(b_)

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

Solution (Python):
a, b = list(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):
H = list(map(int, input().split()))
N = H[0]
M = H[1]
ans=0
if N<M:
    for i in range(M):
        ans+=N*(10**i)
else:
    for i in range(N):
        ans+=M*(10**i)
print(ans)

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

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

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

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(" "))
p = str(a)
q = str(b)
for i in range(b-1):
    p += str(a)
    
for i in range(a-1):
    q += str(b)
    
res = [p,q]
res = sorted(res)
print(res[0])

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

if a <= b:
  ans = '%s' % a
  ans = ans * b
else:
  ans = '%s' % b
  ans = ans * a

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):
def bit_mani(num, quant):
    ans = 0
    for i in range(quant):
        ans *= 10
        ans += num
    return ans

n, m = input().split(" ")
if int(n) < int(m):
    print(bit_mani(int(n), int(m)))
    
else:
    print(bit_mani(int(m), int(n)))

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

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

a_srting = str(a) * b
b_string = str(b) * a


if a_srting < b_string:
    print(a_srting)
else:
    print(b_string)

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

Solution (Python):
a, b = map(int, input().split())
A = str(a)
B = str(b)
for i in range(a-1):
    B = B + str(b)
for j in range(b-1):
    A = A + str(a)

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

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

Solution (Python):
import sys
import math
import bisect
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop


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


def I(): return int(sys.stdin.readline())


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res


def IR(n):
    return [I() for i in range(n)]



def A():
    n, m = LI()
    if n == m:
        print("Yes")
    else:
        print("No")

    return



def B():
    a, b = LI()
    if a <= b:
        ans = str(a) * b
    else:
        ans = str(b) * a
    print(ans)
    return



def C():
    return



def D():
    return



def E():
    return



def F():
    return



if __name__ == "__main__":
    B()

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

Solution (Python):
N, M = list(map(int, input().split()))
if N >= M:
  print(str(M) * N)
else:
  print(str(N) * M)

Solution (Python):
import sys
from collections import defaultdict
from collections import deque
import numpy as np
import heapq
from heapq import heappush, heappop



readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)

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


big = 0
small = 0

if a > b:
    big = a
    small = b
else:
    big = b
    small = a

ans = [str(small)] * big
ans = ''.join(ans)

print(ans)

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

Solution (Python):
import sys
a, b = map(int, sys.stdin.readline().split())

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

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

Solution (Python):

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

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

if sa < sb:
    print(sa*b)
else:
    print(sb*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=input().split()
aa=int(a)
bb=int(b)
aaa=a*bb
bbb=b*aa
print(min(aaa,bbb))

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

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

if aa <= bb:
  print(aa)
else:
  print(bb)

Solution (Python):
import logging

logging.basicConfig(level=logging.INFO, format="%(message)s")


def main():
    a, b = map(int, input().split())
    logging.info("Hello!")

    if a < b:
        if int(str(a) * a) < int(str(b) * a):
            print(str(a) * b)
        else:
            print(str(b) * a)
    else:
        if int(str(a) * b) < int(str(b) * b):
            print(str(a) * b)
        else:
            print(str(b) * a)
            
    
if __name__ == "__main__":
    main()

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

ab = 0
ba = 0

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

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

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