5 3 8 1 9 2 7 4 6

1 2 3 4 5 6 7 8 9

def quick_sort(arr):
    if len(arr) <= 1:
        return arr
    pivot = arr[len(arr) // 2]
    left = [x for x in arr if x < pivot]
    mid = [x for x in arr if x == pivot]
    right = [x for x in arr if x > pivot]
    return quick_sort(left) + mid + quick_sort(right)

nums = list(map(int, input().split()))
print(*quick_sort(nums))