Problem:


Sorting Three Numbers

  Write a program which reads three integers, and prints them in ascending order.

Input

  Three integers separated by a single space are given in a line.

Output

  Print the given integers in ascending order in a line. Put a single space between two integers.

Constraints

  
 1 ≤ the three integers ≤ 10000

Sample Input 1

3 8 1

Sample Output 1

1 3 8



Sample input:
3 8 1


Sample output:
1 3 8

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if(a > b):
    a, b = b, a
if(a > c):
    a, c = c, a
if(b > c):
    b, c = c, b
print(str(a) + ' ' + str(b) + ' ' + str(c))

Submission status: Accepted

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

if a<b and a<c:
	print(a,"",end="")
	if b<c:
		print(b,c)
	else:
		print(c,b)
elif b<c:
	print(b,"",end="")
	if a<c:
		print(a,c)
	else:
		print(c,a)
else:
	print(c,"",end="")
	if a<b:
		print(a,b)
	else:
		print(b,a)

Submission status: Accepted

Solution code:
import sys

l = input()
numbers = list(map(int, l.split()))
numbers.sort()
str_num = list(map(str, numbers))

print(" ".join(str_num))

Submission status: Accepted

Solution code:
l = list(map(int,input().split()))
l.sort()
out_l = " ".join(map(str, l))
print(out_l)

Submission status: Accepted

Solution code:
# ITP1_2_C
# Sorting 
# http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_2_B
# encode : utf-8
numberList = list(map(int, input().split()))
numberList.sort()
print("{0[0]} {0[1]} {0[2]}".format(numberList))

Submission status: Accepted

Solution code:
i = list(map(int,input().split()))
i.sort()
print(i[0],i[1],i[2],sep=' ')

Submission status: Accepted

Solution code:
ns = list(map(int,input().split()))
nr = sorted(ns)
print(nr[0],nr[1],nr[2])

Submission status: Accepted

Solution code:
def number_sort(a, b, c):
    arr = [a, b, c]
    arr = sorted(arr)
    print( str(arr[0]) + " " + str(arr[1]) + " " + str(arr[2]) )

if __name__ == "__main__":

    param = input()
    param = param.split(" ")

    a = int(param[0])
    b = int(param[1])
    c = int(param[2])

    number_sort(a, b, c)

Submission status: Accepted

Solution code:
x=list(map(int,input().split()))
x.sort()
print(str(x[0])+" "+str(x[1])+" "+str(x[2]))

Submission status: Accepted

Solution code:
input_integer = list(map(int, input().rstrip().split(" ")))
input_integer.sort()

print(input_integer[0], end=" ")
print(input_integer[1], end=" ")
print(input_integer[2])

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if a > b:
    tmp = b
    b = a
    a = tmp
if b > c:
    tmp = c
    c = b
    b = tmp
if a > b:
    tmp = b
    b = a
    a = tmp
    
print("{} {} {}".format(a, b, c))

Submission status: Accepted

Solution code:
inlist = input().split()
a1, a2, a3 = (int(x) for x in inlist)

# a = input()
# a = int(a)

if a1 > a2:
    sub = a1
    a1 = a2
    a2 = sub

if a2 > a3:
    sub = a2
    a2 = a3
    a3 = sub

if a1 > a2:
    sub = a1
    a1 = a2
    a2 = sub

print(a1,a2,a3)

Submission status: Accepted

Solution code:
a = map(int, input().split())
print(''.join(map(lambda x: str(x)+' ', sorted(a)))[:-1])

Submission status: Accepted

Solution code:
a=list(int(x) for x in input().split())
a.sort()
print(a[0],a[1],a[2])

Submission status: Accepted

Solution code:
list = input().split()
list.sort()
for i in range(len(list)):
    if i == len(list) - 1:
        print(list[i])
    else:
        print(list[i],end=" ")

Submission status: Accepted

Solution code:
s = input()
a,b,c = s.split()
l = [int(a), int(b), int(c)]
l.sort()

print('{} {} {}'.format(l[0], l[1], l[2]))

Submission status: Accepted

Solution code:
from collections import deque
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")

def main():
    aa=list(map(int,input().split()))
    aa.sort()
    print(*aa)

main()

Submission status: Accepted

Solution code:
table = list(map(int,input().split()))

for i in range(2,0,-1):
    k = 0
    while k < i:
        if table[k] > table[k+1]:
            table[k],table[k+1] = table[k+1],table[k]
        k += 1;


print(table[0],table[1],table[2])

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if a <= b <= c:
    print(a, b, c)
elif a <= c <= b:
    print(a, c, b)
elif b <= a <= c:
    print(b, a, c)
elif b <= c <= a:
    print(b, c, a)
elif c <= a <= b:
    print(c, a, b)
else:
    print(c, b, a)

Submission status: Accepted

Solution code:
three_numbers = map(int, input().split())
a, b, c = sorted(three_numbers)
print(a, b, c)

Submission status: Accepted

Solution code:
a, b, c = (int(x) for x in input().split())
array = []
if 0 <= a and a <= 10000:
  array.append(a)
if 0 <= b and b <= 10000:
  array.append(b)
if 0 <= c and c <= 10000:
  array.append(c)

sorted_array = sorted(array)

print(str(sorted_array[0]), str(sorted_array[1]), str(sorted_array[2]))

Submission status: Accepted

Solution code:
list=input().split()
list=sorted(list)
print(list[0],list[1],list[2])

Submission status: Accepted

Solution code:
ls = list(map(int, input().split()))
ls.sort()
print(*ls)

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
a = sorted(a)
print(a[0],a[1],a[2])

Submission status: Accepted

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

list.sort(x)

print(x[0], x[1], x[2])

Submission status: Accepted

Solution code:
ans = sorted([int(i) for i in input().split()])

print(" ".join([str(i) for i in ans]))

Submission status: Accepted

Solution code:
s = input()
sss = s.split()
sss.sort()
a = int(sss[0])
b = int(sss[1])
c = int(sss[2])
print(a,b,c)

Submission status: Accepted

Solution code:
ls = list(map(int,input().split()))
ls = sorted(ls)
print(*ls)

Submission status: Accepted

Solution code:
y = raw_input()
x = y.split(" ")
a = int(x[0])
b = int(x[1])
c = int(x[2])
numbers = [a,b,c]
numbers.sort()

print(str(numbers[0])+str(" ")+str(numbers[1])+str(" ")+str(numbers[2]))

Submission status: Accepted

Solution code:

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

print(" ".join(map(str, sorted([a, b, c]))))

Submission status: Accepted

Solution code:
print(*sorted(map(int, input().strip().split(' '))))

Submission status: Accepted

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

if b < a:
    t = b
    b = a
    a = t

if c < a:
    t = c
    c = a
    a = t

if c < b:
    t = c
    c = b
    b = t

print("{} {} {}".format(a, b, c))

Submission status: Accepted

Solution code:
print(' '.join(map(str, (sorted(map(int, input().split()))))))

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))
l.sort()
print(l[0],l[1], l[2])

Submission status: Accepted

Solution code:
num = list(map(int, input().split()))
num.sort()
print(num[0],num[1],num[2])

Submission status: Accepted

Solution code:
print(' '.join(map(str, sorted(map(int, input().split())))))

Submission status: Accepted

Solution code:
Input = input().split()
f = int(Input[0])
s = int(Input[1])
t = int(Input[2])

if f <= s <= t :print(f,s,t)
elif f <= t <= s :print(f,t,s)
elif s <= f <= t :print(s,f,t)
elif s <= t <= f :print(s,t,f)
elif t <= f <= s :print(t,f,s)
else:print(t,s,f)

Submission status: Accepted

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

n.sort()

print(n[0],n[1],n[2])

Submission status: Accepted

Solution code:
n = input().split()
a,b,c = map(int,n)
if a < b:
    pass
else:
    a,b = b,a
if b < c:
    pass
else:
    b,c = c,b
if a < b:
    pass
else:
    a,b = b,a
print(f"{a} {b} {c}")

Submission status: Accepted

Solution code:
l=input().split()
l.sort()
if l[0] in range(1,10001) and l[1] in range(1,10001) and l[2] in range(1,10001):
    l.sort()
print(l[0]+" "+str(l[1])+" "+str(l[2]))

Submission status: Accepted

Solution code:
a, b, c = (int(x) for x in input().split())
list = [a, b, c]
MAX = list[0]
if MAX < list[1]:
    MAX = list[1]
if MAX < list[2]:
    MAX = list[2]
list.remove(MAX)
MID = list[0]
MIN = list[1]
if MID < MIN:
    MID = list[1]
    MIN = list[0]
print(MIN, MID, MAX)

Submission status: Accepted

Solution code:
l = input()
x = list(map(int, l.split()))
for i in range(len(x)):
    for j in range(len(x) - i - 1):
        if x[j] > x[j+1]:
            work = x[j+1]
            x[j+1] = x[j]
            x[j] = work
print(f"{x[0]} {x[1]} {x[2]}")

Submission status: Accepted

Solution code:
a=input().split()
for i,v in enumerate(a):
    a[i]=int(v)
a.sort()
print(a[0],a[1],a[2])

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))
a.sort()
print(*a)

Submission status: Accepted

Solution code:
l = map(int, input().split())
l = list(l)

for i in range(2):
    for j in range(2-i):
        if l[j]>l[j+1]:
            x=l[j]
            l[j]=l[j+1]
            l[j+1]=x

print(f"{l[0]} {l[1]} {l[2]}")

Submission status: Accepted

Solution code:
a = sorted(list(map(int, input().split())))
print(str(a[0]) + ' ' + str(a[1]) + ' ' + str(a[2]))

Submission status: Accepted

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

if a > b:
    a, b = b, a
    
if b > c:
    b, c = c, b
    
if a > b:
    a, b = b, a
    
print(a, b, c)

Submission status: Accepted

Solution code:
l=input().split()

l.sort()
print(l[0],l[1],l[2])

Submission status: Accepted

Solution code:
A = [int(x) for x in input().split(' ')]
A.sort()
print(A[0], A[1], A[2])

Submission status: Accepted

Solution code:
A=input().split()
A.sort()
print(*A)

Submission status: Accepted

Solution code:
print(*sorted(list(map(int,input().split()))))

Submission status: Accepted

Solution code:
l=list(map(int,input().split()))

L=sorted(l)

print(*L)

Submission status: Accepted

Solution code:
nums=list(map(int,input().split()))
nums.sort()
print(nums[0],nums[1],nums[2])

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())
if a <= b <= c:
 print(a, b, c)
elif a <= c < b:
 print(a, c, b)
elif b < a <= c:
 print(b, a, c)
elif b < c < a:
 print(b, c, a)
elif c < a <= b:
 print(c, a, b)
else:
 print(c, b, a)

Submission status: Accepted

Solution code:
x,y,z=(int(x) for x in input().split())
if x>y:
    x,y=y,x
if x>z:
    x,z=z,x
if y>z:
    y,z=z,y
print (x,y,z)

Submission status: Accepted

Solution code:
a = []
a[:] = map(int, input().split())
for i in range(1,3):
    v = a[i]
    j = i-1
    while (j>=0 and a[j]>v):
        a[j+1] = a[j]
        j-=1
        a[j+1]=v
s = map(str, a)
print(' '.join(s))

Submission status: Accepted

Solution code:
str=input()
str_list=str.split()
a=int(str_list[0])
b=int(str_list[1])
c=int(str_list[2])

if a > b:
    tmp=a
    a=b
    b=tmp
if a > c:
    tmp=a
    a=c
    c=tmp

if b > c:
    tmp=b
    b=c
    c=tmp

print(a,b,c)

Submission status: Accepted

Solution code:

# 冒泡排序
def bubbleSort(arr):
    for i in range(1, len(arr)):
        for j in range(0, len(arr)-i):
            if arr[j] > arr[j+1]:
                arr[j], arr[j + 1] = arr[j + 1], arr[j]
    return arr

def main():
    arr = [int(x) for x in input().split()]
    sort_arr = [str(x) for x in bubbleSort(arr)]
    str_arr = ' '.join(sort_arr)
    print(str_arr)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
table = list(map(int,input().split()))

table.sort()
print(table[0],table[1],table[2])

Submission status: Accepted

Solution code:
a,b,c = sorted(map(int, input().split()))
print(a,b,c)

Submission status: Accepted

Solution code:
l = list(map(int,input().split()))
x = l[0]
y = l[1]
z = l[2]

if x < y:
    if y < z:
        print(str(l[0]) + ' ' + str(l[1]) + ' ' + str(l[2]))
    else:
        if x < z:
            print(str(l[0]) + ' ' + str(l[2]) + ' ' + str(l[1]))
        else:
            print(str(l[2]) + ' ' + str(l[0]) + ' ' + str(l[1]))
else:
    if y > z:
        print(str(l[2]) + ' ' + str(l[1]) + ' ' + str(l[0]))
    else:
        if x < z:
            print(str(l[1]) + ' ' + str(l[0]) + ' ' + str(l[2]))
        else:
            print(str(l[1]) + ' ' + str(l[2]) + ' ' + str(l[0]))

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())
if a < b:
    if b < c:
        print(f"{a} {b} {c}")
    else:
        if a < c:
            print(f"{a} {c} {b}")
        else:
            print(f"{c} {a} {b}")
else:
    if a < c:
        print(f"{b} {a} {c}")
    else:
        if b < c:
            print(f"{b} {c} {a}")
        else:
            print(f"{c} {b} {a}")

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
a.sort()
for i in range(len(a)):
    if i != 2:
        print('{} '.format(a[i]),end='')
    else:
        print(a[i])

Submission status: Accepted

Solution code:
lst = list(map(int,input().split()))
lst.sort()
print(lst[0],lst[1],lst[2])

Submission status: Accepted

Solution code:
i = input()
a,b,c = map(int, i.split())

if a > b :
  x = a
  a = b
  b = x

if b > c :
  x = b
  b = c
  c = x

if a > b :
  x = a
  a = b
  b = x


print(a,b,c)

Submission status: Accepted

Solution code:
list = list(map(int, input().split()))
list.sort()
print(list[0], list[1], list[2])

Submission status: Accepted

Solution code:
ls = sorted([int(s) for s in input().split()])
print(' '.join([str(s) for s in ls]))

Submission status: Accepted

Solution code:
x=input().split(" ")
a=int(x[0])
b=int(x[1])
c=int(x[2])

if a>b:
    temp = a
    a = b
    b = temp

if b>c:
    temp = b
    b = c
    c = temp

if a>b:
    temp = a
    a = b
    b = temp
    
print(str(a)+" "+str(b)+" "+str(c))

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
f = 1
if a<b:
    pass
else:
    f = a
    a = b
    b = f
if b < c:
    pass
else:
    if a<c:
        f = b
        b = c
        c = f
    else:
        f = c
        c = b
        b = a
        a = f
print(f"{a} {b} {c}")

Submission status: Accepted

Solution code:
def main():
    A = [int(i) for i in input().split()]
    print(*sorted(A))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
i = input()
a,b,c = map(int, i.split())

if b>c:
    tmp = b
    b = c
    c = tmp
    
if a>b:
    tmp = a
    a = b
    b = tmp
    
if b>c:
    tmp = b
    b = c
    c = tmp

print(a,b,c)

Submission status: Accepted

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

if a>b:
    a,b=b,a

if b>c:
    b,c=c,b

if a>b:
    a,b=b,a

print(a, b, c)

Submission status: Accepted

Solution code:
A = list(map(int,input().split()))
A.sort()
A_str = [str(n) for n in A]
str = ' '.join(A_str)
print(str)

Submission status: Accepted

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

i=sorted(i)
print(" ".join([str(n) for n in i]))

Submission status: Accepted

Solution code:

l=input().split()

l.sort()


print(l[0],l[1],l[2])

Submission status: Accepted

Solution code:
list=sorted(list(map(int,input().split())))
print(str(list[0]) + " " + str(list[1]) + " " + str(list[2]))

Submission status: Accepted

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

if a <= b <= c:
    print(a,b,c)
elif a <= c <= b:
    print(a,c,b)
elif b <= a <= c:
    print(b,a,c)
elif b <= c <= a:
    print(b,c,a)
elif c <= a <= b:
    print(c,a,b)
else:
    print(c,b,a)

Submission status: Accepted

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

a.sort()
print(a[0],a[1],a[2])

Submission status: Accepted

Solution code:
s=list(map(int,input().split()))
s.sort()

for i in range(3):
    if i >0:
        print(" ",end="")
    print(s[i],end="")
print("")

Submission status: Accepted

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

if a > b :
    tmp = a
    a = b
    b = tmp
    
if b > c :
    tmp = b
    b = c
    c =tmp
    
if a > b :
    tmp = a
    a = b
    b = tmp
    
print(a, b, c)

Submission status: Accepted

Solution code:
nums = list(map(int, input().split(" ")))

for i in range(len(nums)-1):
    for j in range(len(nums)-1):
        if nums[j] > nums[j+1]:
            nums[j], nums[j+1] = nums[j+1], nums[j]
            
for i in range(len(nums)):
    nums[i] = str(nums[i])

string = " ".join(nums)

print(string)

Submission status: Accepted

Solution code:
a, b, c = map(int,input().split())
if a > b :
    a = a + b
    b = a - b
    a = a - b
if b >  c :
    b = b + c
    c = b - c
    b = b - c
if  a > b :
    a = a + b
    b = a - b
    a = a - b

print(a,b,c)

Submission status: Accepted

Solution code:
num_list = sorted(list(map(int, input().split())))
print(*num_list, sep=" ")

Submission status: Accepted

Solution code:
a = input()
b = a.split(" ")
if int(b[0]) <= int(b[1]) <= int(b[2]):
    print(b[0], b[1], b[2])
elif int(b[0]) <= int(b[2]) <= int(b[1]):
    print(b[0], b[2], b[1])
elif int(b[1]) <= int(b[0]) <= int(b[2]):
    print(b[1], b[0], b[2])
elif int(b[1]) <= int(b[2]) <= int(b[0]):
    print(b[1], b[2], b[0])
elif int(b[2]) <= int(b[1]) <= int(b[0]):
    print(b[2], b[1], b[0])
elif int(b[2]) <= int(b[0]) <= int(b[1]):
    print(b[2], b[0], b[1])

Submission status: Accepted

Solution code:
a, b, c = sorted(map(int, input().split()))
print(a, b, c)

Submission status: Accepted

Solution code:
list = [int(e) for e in input().split()]
list.sort()
list
hoge = []
for i in list:
    hoge.append(i)
    hoge.append(" ")
hoge.pop()
str(hoge)
print("".join(map(str,hoge)))

Submission status: Accepted

Solution code:
l=sorted(map(int,input().split()))
print(*l)

Submission status: Accepted

Solution code:
l = input().split()

a = int(l[0])
b = int(l[1])
c = int(l[2])

if a > b:
    w = a
    a = b
    b = w
if b > c:
    w = b
    b = c
    c = w
if a > b:
    w = a
    a = b
    b = w
print(a,b,c)

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
if a <= b and b <= c:
    print(f"{a} {b} {c}")
elif a <= c and  c <= b:
    print(f"{a} {c} {b}")
elif b <= a and a <= c:
    print(f"{b} {a} {c}")
elif b <= c and c <= a:
    print(f"{b} {c} {a}")
elif c <= a and a <= b:
    print(f"{c} {a} {b}")
else:
    print(f"{c} {b} {a}")

Submission status: Accepted

Solution code:
a,b,c = input().split()
if a>b :
    q = a
    a = b
    b = q
if b>c :
    q = b
    b = c
    c = q
if a>b :
    q = a
    a = b
    b = q
print(str(a) + " " + str(b) +  " " + str(c))

Submission status: Accepted

Solution code:
vals = list(map(int, input().split()))
vals.sort()
print(vals[0], vals[1], vals[2])

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))
a.sort()
print(f"{a[0]} {a[1]} {a[2]}")

Submission status: Accepted

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

if(b < a):
    if(a <= c):
        print(b,a,c)
    else:
        print(min(b,c),max(b,c),a)
elif( a < b):
    if(b <= c):
        print(a,b,c)
    else:
        print(min(a,c),max(a,c),b)
    
elif(a < c): # a == b である
    print(a,b,c)
    if(a > c):
        print(c,a,b)

Submission status: Accepted

Solution code:
i = input()

a, b, c = map(int, i.split())

if a > b:
    num = a
    a = b
    b = num

if b > c:
    num = b
    b = c
    c = num

if a > b:
    num = a
    a = b
    b = num


print(a, b, c)

Submission status: Accepted

Solution code:
a, b , c = sorted(input().split())
print(a,b,c)

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
if a > b:
    a,b = b,a
if b > c:
    b,c = c,b
if a > b:
    a,b = b,a
print(f"{a} {b} {c}")

Submission status: Accepted

Solution code:
def print_result(arr, n):
    for i in range(n):
        if i > 0:
            print(' ', end='')
        print(arr[i], end='')
    print('\n', end='')


arr = [eval(x) for x in input().split()]
arr.sort()
print_result(arr, arr.__len__())

Submission status: Accepted

Solution code:
x=input().split()
a=list(map(int,x))
a.sort()
print(a[0],a[1],a[2])

Submission status: Accepted

Solution code:
nums = list(map(int, input().split()))
nums.sort()
print(*nums)

Submission status: Accepted

Solution code:
print(*sorted([int(i) for i in input().split()]))

Submission status: Accepted

Solution code:
def pri(a):
    n = len(a)
    for i in range(n):
        if i != n - 1:
            print(a[i], end=' ')
        else:
            print(a[i], end='')
    print('')


def insertSort(a):
    n = len(a)
    for i in range(1, n):
        v = a[i]
        j = i - 1
        while j >= 0 and a[j] > v:
            a[j + 1] = a[j]
            j -= 1
        a[j + 1] = v


a = list(input().split())
# print(a)
insertSort(a)
pri(a)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if a > b:
    a, b = b, a
if b > c:
    b, c = c, b
if a > b:
    a, b = b, a
print(a, b, c)

Submission status: Accepted

Solution code:
table = list(map(int, input().split()))

table.sort()

print(table[0], table[1], table[2])

Submission status: Accepted

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

# 小さい順に並べるアルゴリズム
# a > b ならば、入れ替える
if a > b:
    a, b = b, a
# b > c ならば、入れ替える
if b > c:
    b, c = c, b
# a > b ならば、入れ替える
if a > b:
    a, b = b, a
    
print(a, b, c)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if a > b:
    v = a; a = b; b = v
if b > c:
    v = b; b = c; c = v
if a > b:
    v = a; a = b; b = v
print(a, b, c)

Submission status: Accepted

Solution code:
A = []
A = input().split()
A.sort()
print("{} {} {}".format(A[0],A[1],A[2]))

Submission status: Accepted

Solution code:
l = input().split()

a = int(l[0])
b = int(l[1])
c = int(l[2])

if(a < b):
   if(b < c):
      print(a, b, c)
   else:
      print(a, c, b)
elif(b < c):
   print(b, c, a)
else:
   print(c, b, a)

Submission status: Accepted

Solution code:
a, b, c = (int(x) for x in input().split())
x = [a, b, c]
x.sort()
print(x[0],x[1],x[2] )

Submission status: Accepted

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

a.sort()

for i in range(2):
    print(a[i], end=' ')

print(a[2])

Submission status: Accepted

Solution code:
N = sorted(list(map(int, input().split())))

print(str(N[0]) + " " + str(N[1]) + " " + str(N[2]))

Submission status: Accepted

Solution code:
li = list(map(int, input().split(' ')))

li.sort()
print('%d %d %d' % (li[0], li[1], li[2]))

Submission status: Accepted

Solution code:
a,b,c = (int(x) for x in input().split())
tmp = 0
if a > b:
    tmp = a
    a = b
    b = tmp
if b > c:    
    tmp = b
    b = c 
    c = tmp
if a > b:
    tmp = a
    a = b
    b = tmp
print(a,b,c)

Submission status: Accepted

Solution code:
a = [int(x) for x in input().split()]

a.sort()

print(a[0],a[1],a[2])

Submission status: Accepted

Solution code:
n = list(map(int,input().split()))
n.sort()
print(n[0],n[1],n[2])

Submission status: Accepted

Solution code:
unsort_list = list(map(int, input().strip().split()))

for j in range(3):
    for i in range(2):
        if unsort_list[i] > unsort_list[i+1]:
            unsort_list[i], unsort_list[i+1] = unsort_list[i+1], unsort_list[i]
print(*unsort_list)

Submission status: Accepted

Solution code:
l = input().split()
a = int(l[0])
b = int(l[1])
c = int(l[2])

for i in range(1,10):
    if a>b:
        a,b = b,a
    elif b>c:
        b,c = c,b
    elif a>b:
        a,b = b,a
    else :
        pass
print(a,b,c)

Submission status: Accepted

Solution code:
input_line = list(map(int, input().split()))
input_line = sorted(input_line)
for i in input_line:
    if i == input_line[len(input_line)-1]:
        print(i)
    else:
        print(i, end=" ")

Submission status: Accepted

Solution code:
l = [int(s) for s in input().split()]
l.sort()
print('%d %d %d'%(l[0], l[1], l[2]))

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
if 1 <= a and a <= 10000 and 1 <= b and b <= 10000 and 1 <= c and c <= 10000:
    if a <= b and b <= c: # a<b<c
        d = a
        e = b
        f = c
    elif a <= c and c <= b: # a<c<b
        d = a
        e = c
        f = b
    elif b <= a and a <= c: # b<a<c
        d = b
        e = a
        f = c
    elif b <= c and c <= a: # b<c<a
        d = b
        e = c
        f = a
    elif c <= a and a <= b: # c<a<b
        d = c
        e = a
        f = b
    elif c <= b and b <= a: # c<b<a
        d = c
        e = b
        f = a
    print(str(d) + " " + str(e) + " " + str(f))

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if b>c:
    b,c=c,b
if a>b:
    a,b=b,a
if b>c:
    b,c=c,b
print(a,b,c)

Submission status: Accepted

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

if a >= b >= c:
    print("%d %d %d" % (c,b,a))
elif a >= c >= b:
    print("%d %d %d" % (b,c,a))
elif b >= a >= c:
    print("%d %d %d" % (c,a,b))
elif b >= c >= a:
    print("%d %d %d" % (a,c,b))
elif c >= b >= a:
    print("%d %d %d" % (a,b,c))
elif c >= a >= b:
    print("%d %d %d" % (b,a,c))

Submission status: Accepted

Solution code:
def test():

	i = list(map(int,input().split()))
	if i[0] < i[1]:
		if i[2] < i[0]:
			print(f"{i[2]} {i[0]} {i[1]}")
		elif i[1] < i[2]:
			print(f"{i[0]} {i[1]} {i[2]}")
		else:
			print(f"{i[0]} {i[2]} {i[1]}")
	else:
		if i[2] < i[1]:
			print(f"{i[2]} {i[1]} {i[0]}")
		elif i[0] < i[2]:
			print(f"{i[1]} {i[0]} {i[2]}")
		else:
			print(f"{i[1]} {i[2]} {i[0]}")

if __name__ == "__main__":
	test()

Submission status: Accepted

Solution code:
# coding: utf-8

x = list(map(int, input().split()))
lenx = len(x)
for i in range(lenx):
    j = lenx - 2
    while i <= j:
        if x[j] > x[j + 1]:
            temp = x[j]
            x[j] = x[j + 1]
            x[j + 1] = temp
        j -= 1
for i in range(lenx):
    print(x[i], end = '')
    if i < lenx - 1:
        print(' ', end = '')
print('')

Submission status: Accepted

Solution code:
table = list(map(int, input().split()))


table.sort()
print(table[0],table[1],table[2])

Submission status: Accepted

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

print(' '.join([str(a) for a in sorted(A)]))

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
print(" ".join([str(i) for i in sorted([a, b, c])]))

Submission status: Accepted

Solution code:
li = map(int, input().split(' '))
sorted_list = sorted(li)
print(' '.join(map(str, sorted_list)))

Submission status: Accepted

Solution code:
A = list(map(int, input().split()))
A = sorted(A)
a,b,c =A[0],A[1],A[2] 
print("{} {} {}".format(a, b, c))

Submission status: Accepted

Solution code:
array = input().split(' ')
array.sort()
print(array[0]+' ' +array[1]+' ' +array[2])

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
x = sorted((a,b,c))
print(x[0], x[1], x[2])

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
if a > b:
    a,b = b,a
if b > c:
    b,c = c,b
if a > b:
    a,b = b,a 
print(a,b,c)

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
a.sort()
print(a[0],a[1],a[2])

Submission status: Accepted

Solution code:
l=list(map(int,input().split()))
print(' '.join([str(n) for n in sorted(l)]))

Submission status: Accepted

Solution code:
print(" ".join(map(str, sorted(map(int, input().split())))))

Submission status: Accepted

Solution code:
import sys
nums = list(sorted(map(lambda x: int(x), sys.stdin.readline().split(' '))))

print(nums[0], nums[1], nums[2])

Submission status: Accepted

Solution code:
l = input().split(' ')
l = sorted(l)

ans = ""
for i in range(len(l)):
    ans += " " + str(l[i])
ans = ans.lstrip()
print(ans)

Submission status: Accepted

Solution code:
l = map(int, raw_input().split())
l.sort()
print l[0], l[1], l[2]

Submission status: Accepted

Solution code:
s = input().split()
list = []
list.append(int(s[0]))
list.append(int(s[1]))
list.append(int(s[2]))

#print(list)

for i in range(2):
    for j in range(2):
        if list[j]>list[j+1]:
            swap = list[j]
            list[j] = list[j+1]
            list[j+1] = swap

print(list[0],list[1],list[2])

Submission status: Accepted

Solution code:
a = [int(i) for i in input().split()]
a.sort()
print(' '.join(map(str, a)))

Submission status: Accepted

Solution code:
As = list(map(int, input().split()))
As = sorted(As)
print(*As)

Submission status: Accepted

Solution code:
l=input().split()
a=int(l[0])
b=int(l[1])
c=int(l[2])
if a>b:
    a,b=b,a
if b>c:
    b,c=c,b
if a>b:
    a,b=b,a
print(f"{a} {b} {c}")

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))

l.sort()
print(" ".join(map(str, l)))

Submission status: Accepted

Solution code:
abc = list(map(int, input().split()))

if abc[0] > abc[1]:
    abc[0], abc[1] = abc[1], abc[0]
if abc[1] > abc[2]:
    abc[1], abc[2] = abc[2], abc[1]
if abc[0] > abc[1]:
    abc[0], abc[1] = abc[1], abc[0]

print("{} {} {}".format(abc[0], abc[1], abc[2]))

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
if a>b:
    a,b = b,a
if b>c:
    b,c = c,b
if a>b:
    a,b = b,a
    
print(a,b,c)

Submission status: Accepted

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

if a > b:
  x=a
  a=b
  b=x

if b > c:
  x=b
  b=c
  c=x

if a > b:
  x=a
  a=b
  b=x

print(str(a)+" "+str(b)+" "+str(c))

Submission status: Accepted

Solution code:
nums = list(map(int, input().split()))
for i in range(len(nums)-1,0,-1):
    for j in range(i):
        if nums[j] > nums[j+1]:
            nums[j], nums[j+1] = nums[j+1], nums[j]
print(' '.join(str(n) for n in nums))

Submission status: Accepted

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

if a > b:
  tmp = a
  a = b
  b = tmp
if b > c:
  tmp = b
  b = c
  c = tmp
if a > b:
  tmp = a
  a = b
  b = tmp
  
print(a, end=' ')
print(b, end=' ')
print(c)

Submission status: Accepted

Solution code:
x = input().split()
x.sort()
a, b, c = [str(x) for x in x]
print(a+" "+b+" "+c)

Submission status: Accepted

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

if a<=b<=c:
    print(a,b,c)
elif a<=c<=b:
    print(a,c,b)
elif b<=a<=c:
    print(b,a,c)
elif b<=c<=a:
    print(b,c,a)
elif c<=a<=b:
    print(c,a,b)
else:
    print(c,b,a)

Submission status: Accepted

Solution code:
a= list(map(int, input().split()))
a.sort()
print(str(a[0])+" "+str(a[1])+" "+str(a[2] ))

Submission status: Accepted

Solution code:
print(*sorted(int(x) for x in input().split()))

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if a <= b and b <= c:
 print(f"{a} {b} {c}")

elif b <= a and a <= c:
 print(f"{b} {a} {c}")

elif b <=  c and c <= a:
 print(f"{b} {c} {a}")

elif a <= c and c <= b:
 print(f"{a} {c} {b}")

elif c <= a and a <= b:
 print(f"{c} {a} {b}")

elif c <= b and b <= a:
 print(f"{c} {b} {a}")

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if a <= b and b <= c:
 print(f"{a} {b} {c}")

elif b <= a and a <= c:
 print(f"{b} {a} {c}")

elif b <=  c and c <= a:
 print(f"{b} {c} {a}")

elif a <= c and c <= b:
 print(f"{a} {c} {b}")


elif c <= a and a <= b:
 print(f"{c} {a} {b}")

elif c <= b and b <= a:
 print(f"{c} {b} {a}")

Submission status: Accepted

Solution code:
num_list = list(map(int, input().split()))
num_list.sort()
print(num_list[0], num_list[1], num_list[2])

Submission status: Accepted

Solution code:
sl = sorted(map(int,input().split()))
print("{} {} {}".format(sl[0],sl[1],sl[2]))

Submission status: Accepted

Solution code:
abc = sorted(list(map(int, input().split())))
print(*abc, sep=' ')

Submission status: Accepted

Solution code:
z = list(map(int, input().split()))
z.sort()
print(' '.join([str(x) for x in z]))

Submission status: Accepted

Solution code:
li = list(map(int,input().split()))

li.sort()

print(*li)

Submission status: Accepted

Solution code:
l = [int(x) for x in input().split()]
print(" ".join([str(x) for x in sorted(l)]
))

Submission status: Accepted

Solution code:
nums = map(int, input().split())

nums = sorted(nums)
print("{0[0]} {0[1]} {0[2]}".format(nums))

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())
if a <= b <= c:
    print (a, b, c)
elif a <= c <= b:
    print (a, c, b)
elif b <= a <= c:
    print (b, a, c)
elif b <= c <= a:
    print (b, c, a)
elif c <= a <= b:
    print (c, a, b)
else:
    print (c, b, a)