def selection_sort(lst):

	n = len(lst)

	for i in range(n): # to loop throught through all the elments within the list

		smallest_index = i # let the index for smallest element be initially i

		for j in range(i+1, n):  # loop from i + 1 to n 
			if(lst[j] < lst[smallest_index]):  # if any element is less than lst[smallest_index]
				smallest_index = j # then smallest index becomes the new index

		# swapping the elements (swapping 2 nos operation)
		temp = lst[smallest_index]
		lst[smallest_index] = lst[i]
		lst[i] = temp

	return lst # return sorted list

l=list(map(int, input().split())
print(selection_sort(l))

7d2a45f0a81adeaecd6e894068e7cd1930a86e7c
def selection_sort(lst):

	n = len(lst)

	for i in range(n): # to loop throught through all the elments within the list

		smallest_index = i # let the index for smallest element be initially i

		for j in range(i+1, n):  # loop from i + 1 to n 
			if(lst[j] < lst[smallest_index]):  # if any element is less than lst[smallest_index]
				smallest_index = j # then smallest index becomes the new index

		# swapping the elements (swapping 2 nos operation)
		temp = lst[smallest_index]
		lst[smallest_index] = lst[i]
		lst[i] = temp

	return lst # return sorted list

l=list(map(int, input().split())
print(selection_sort(l))
