
def 	_SCREAMING_SNAKE_CASE					(		_lowerCamelCase :			int)					->    Optional[int]:






							'''simple docstring'''





							if collection == []:
														return []

							# get some information about the collection
							__UpperCamelCase	:   Any			   =					len(_lowerCamelCase)
							__UpperCamelCase	:   Dict			   =					max(_lowerCamelCase)
							__UpperCamelCase	:   List[Any]			   =					min(_lowerCamelCase)

							# create the counting array
							__UpperCamelCase	:   str			   =					coll_max + 1 - coll_min
							__UpperCamelCase	:   Tuple			   =					[0] * counting_arr_length

							# count how much a number appears in the collection
							for number in collection:
														counting_arr[number - coll_min] += 1

							# sum each position with it's predecessors. now, counting_arr[i] tells
							# us how many elements <= i has in the collection
							for i in range(1						,  _lowerCamelCase):
														__UpperCamelCase	:   List[str]			   =					counting_arr[i] + counting_arr[i - 1]

							# create the output collection
							__UpperCamelCase	:   int			   =					[0] * coll_len

							# place the elements in the output, respecting the original order (stable
							# sort) from end to begin, updating counting_arr
							for i in reversed(range(0						,  _lowerCamelCase)):
														__UpperCamelCase	:   int			   =					collection[i]
														counting_arr[collection[i] - coll_min] -= 1

							return ordered




def 	_SCREAMING_SNAKE_CASE					(		_lowerCamelCase :			Optional[int])					->    Union[str, Any]:






							'''simple docstring'''





							return "".join([chr(_lowerCamelCase) for i in counting_sort([ord(_lowerCamelCase) for c in string])])


if __name__ == "__main__":
		# Test string sort
		assert counting_sort_string('thisisthestring') == "eghhiiinrsssttt"

		lowercase  :					List[str]													=       input('Enter numbers separated by a comma:\n').strip()
		lowercase  :					Tuple													=       [int(item) for item in user_input.split(',')]
		print(counting_sort(unsorted))

class  lowerCamelCase__							:




	'''simple docstring'''




	def __init__(					self		:int						)		-> Dict:
								__UpperCamelCase	:   Union[str, Any]			   =					{}







	def    _lowerCamelCase				(					self		:str						)		-> None:
								print(self.vertex						)
								for i in self.vertex:
															print(a     ,   " -> "     ,   " -> ".join([str(a						) for j in self.vertex[i]]						)						)







	def    _lowerCamelCase				(					self		:List[Any]     ,   a		:int     ,   a		:int						)		-> None:
								# check if vertex is already present,
								if from_vertex in self.vertex:
															self.vertex[from_vertex].append(a						)
								else:
															# else make a new vertex
															__UpperCamelCase	:   Optional[Any]			   =					[to_vertex]







	def    _lowerCamelCase				(					self		:Tuple						)		-> None:
								# visited array for storing already visited nodes
								__UpperCamelCase	:   Dict			   =					[False] * len(self.vertex						)

								# call the recursive helper function
								for i in range(len(self.vertex						)						):
															if not visited[i]:
																						self.dfs_recursive(a     ,   a						)







	def    _lowerCamelCase				(					self		:Any     ,   a		:int     ,   a		:list						)		-> None:
								# mark start vertex as visited
								__UpperCamelCase	:   int			   =					True

								print(a     ,   end=" "						)

								# Recur for all the vertices that are adjacent to this node
								for i in self.vertex:
															if not visited[i]:
																						self.dfs_recursive(a     ,   a						)


if __name__ == "__main__":
		lowercase  :					Dict													=       Graph()
		g.add_edge(0, 1)
		g.add_edge(0, 2)
		g.add_edge(1, 2)
		g.add_edge(2, 0)
		g.add_edge(2, 3)
		g.add_edge(3, 3)

		g.print_graph()
		print('DFS:')
		g.dfs()

		# OUTPUT:
		# 0  ->  1 -> 2
		# 1  ->  2
		# 2  ->  0 -> 3
		# 3  ->  3
		# DFS:
		#  0 1 2 3