






'''simple docstring'''



SCREAMING_SNAKE_CASE							=						{'a': ['c', 'b'], 'b': ['d', 'e'], 'c': [], 'd': [], 'e': []}
SCREAMING_SNAKE_CASE							=						['a', 'b', 'c', 'd', 'e']


def 				lowercase_					(     __A			:							Dict       ,   __A			:							Optional[int]       ,   __A			:							int      )							->   List[str]:



 """simple docstring"""




 lowercase       : Union[str, Any]						=start
 # add current to visited
 visited.append(__A      )
 lowercase       : int						=edges[current]
 for neighbor in neighbors:
  # if neighbor not in visited, visit
  if neighbor not in visited:
   lowercase       : Dict						=topological_sort(__A       ,   __A       ,   __A      )
    # if all neighbors visited add current to sort
 sort.append(__A      )
 # if all vertices haven't been visited select a new one to visit
 if len(__A      ) != len(__A      ):
  for vertice in vertices:
   if vertice not in visited:
    lowercase       : Tuple						=topological_sort(__A       ,   __A       ,   __A      )
    # return sort
 return sort


if __name__ == "__main__":
      SCREAMING_SNAKE_CASE							=						topological_sort('a', [], [])
      print(sort)







'''simple docstring'''


from __future__ import annotations







def      snake_case_  (    SCREAMING_SNAKE_CASE__				, SCREAMING_SNAKE_CASE__	):







				"""simple docstring"""





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

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







def      snake_case_  (    SCREAMING_SNAKE_CASE__				, SCREAMING_SNAKE_CASE__	):







				"""simple docstring"""





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

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

				insert_next(SCREAMING_SNAKE_CASE__				, index + 1	)


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




