


from __future__ import annotations
def 	_UpperCamelCase					(    lowerCAmelCase_ )    ->list[int]:
   if len(lowerCAmelCase_ ) == 0:
      return array

   UpperCAmelCase					,	UpperCAmelCase      					=  min(lowerCAmelCase_ ), max(lowerCAmelCase_ )

   # Compute the variables
   UpperCAmelCase      					=  _max - _min + 1
   UpperCAmelCase					,	UpperCAmelCase      					=  [0] * holes_range, [0] * holes_range

   # Make the sorting.
   for i in array:
      UpperCAmelCase      					=  i - _min
      UpperCAmelCase      					=  i
      holes_repeat[index] += 1

   # Makes the array back by replacing the numbers.
   UpperCAmelCase      					=  0
   for i in range(lowerCAmelCase_ ):
      while holes_repeat[i] > 0:
         UpperCAmelCase      					=  holes[i]
         index += 1
         holes_repeat[i] -= 1

    # Returns the sorted array.
   return array


if __name__ == "__main__":
 import doctest

 doctest.testmod()
 __a	 =      input("""Enter numbers separated by comma:\n""")
 __a	 =      [int(x) for x in user_input.split(""",""")]
 print(pigeon_sort(unsorted))







class 	__lowercase					:





      def __init__(		self    :       Optional[int]							)     -> int:






         """simple docstring"""







         UpperCAmelCase      					=  {}





      def 							_lowercase					(		self    :       str							)     -> None:






         """simple docstring"""







         print(self.vertex							)
         for i in self.vertex:
            print(__lowerCamelCase       ,							""" -> """       ,							""" -> """.join([str(__lowerCamelCase							) for j in self.vertex[i]]							)							)





      def 							_lowercase					(		self    :       Optional[Any]       ,							__lowerCamelCase    :       int       ,							__lowerCamelCase    :       int							)     -> None:






         """simple docstring"""







         if from_vertex in self.vertex:
            self.vertex[from_vertex].append(__lowerCamelCase							)
         else:
            # else make a new vertex
            UpperCAmelCase      					=  [to_vertex]





      def 							_lowercase					(		self    :       str							)     -> None:






         """simple docstring"""







         UpperCAmelCase      					=  [False] * len(self.vertex							)

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





      def 							_lowercase					(		self    :       Optional[int]       ,							__lowerCamelCase    :       int       ,							__lowerCamelCase    :       list							)     -> None:






         """simple docstring"""







         UpperCAmelCase      					=  True

         print(__lowerCamelCase       ,							end=""" """							)

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


if __name__ == "__main__":
 __a	 =      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



