






from __future__ import annotations




def      __A					(     _lowercase					,			_lowercase ):

     '''simple docstring'''







     if len(_lowercase ) <= 1 or n <= 1:
          return

     insert_next(_lowercase					,			n - 1 )
     rec_insertion_sort(_lowercase					,			n - 1 )




def      __A					(     _lowercase					,			_lowercase ):

     '''simple docstring'''







     if index >= len(_lowercase ) or collection[index - 1] <= collection[index]:
          return

     # Swaps adjacent elements since they are not in ascending order
     _A							,_A								= (
         collection[index],
         collection[index - 1],
     )

     insert_next(_lowercase					,			index + 1 )


if __name__ == "__main__":
    __A      =				input('Enter integers separated by spaces: ')
    __A      =				[int(num) for num in numbers.split()]
    rec_insertion_sort(number_list, len(number_list))
    print(number_list)











def      __A					(     _lowercase ):

					'''simple docstring'''







					_A								= [0] * len(_lowercase )
					_A								= []
					_A								= []
					_A								= 0

					for values in graph.values():
										for i in values:
															indegree[i] += 1

					for i in range(len(_lowercase ) ):
										if indegree[i] == 0:
															queue.append(_lowercase )

					while queue:
										_A								= queue.pop(0 )
										cnt += 1
										topo.append(_lowercase )
										for x in graph[vertex]:
															indegree[x] -= 1
															if indegree[x] == 0:
																				queue.append(_lowercase )

					if cnt != len(_lowercase ):
										print('''Cycle exists''' )
					else:
										print(_lowercase )


# Adjacency List of Graph
__A      =				{0: [1, 2], 1: [3], 2: [3], 3: [4, 5], 4: [], 5: []}


topological_sort(graph)



