


import random


def      a	(							SCREAMING_SNAKE_CASE_      :		int							,			SCREAMING_SNAKE_CASE_      :		float							,			SCREAMING_SNAKE_CASE_      :		bool = False       ):






       """simple docstring"""





       UpperCamelCase    :	dict   	=		{i: [] for i in range(SCREAMING_SNAKE_CASE_       )}

       # if probability is greater or equal than 1, then generate a complete graph
       if probability >= 1:
              return complete_graph(SCREAMING_SNAKE_CASE_       )
       # if probability is lower or equal than 0, then return a graph without edges
       if probability <= 0:
              return graph

       # for each couple of nodes, add an edge from u to v
       # if the number randomly generated is greater than probability probability
       for i in range(SCREAMING_SNAKE_CASE_       ):
              for j in range(i + 1							,			SCREAMING_SNAKE_CASE_       ):
                     if random.random() < probability:
                            graph[i].append(SCREAMING_SNAKE_CASE_       )
                            if not directed:
                                   # if the graph is undirected, add an edge in from j to i, either
                                   graph[j].append(SCREAMING_SNAKE_CASE_       )
       return graph


def      a	(							SCREAMING_SNAKE_CASE_      :		int       ):






       """simple docstring"""





       return {
           i: [j for j in range(SCREAMING_SNAKE_CASE_       ) if i != j] for i in range(SCREAMING_SNAKE_CASE_       )
       }


if __name__ == "__main__":
     import doctest

     doctest.testmod()





from __future__ import annotations


def      a	(							SCREAMING_SNAKE_CASE_      :		list[int]       ):






       """simple docstring"""





       if len(SCREAMING_SNAKE_CASE_       ) == 0:
              return array

       UpperCamelCase	, UpperCamelCase    :	Union[str, Any]   	=		min(SCREAMING_SNAKE_CASE_       ), max(SCREAMING_SNAKE_CASE_       )

       # Compute the variables
       UpperCamelCase    :	Union[str, Any]   	=		_max - _min + 1
       UpperCamelCase	, UpperCamelCase    :	Optional[Any]   	=		[0] * holes_range, [0] * holes_range

       # Make the sorting.
       for i in array:
              UpperCamelCase    :	Optional[int]   	=		i - _min
              UpperCamelCase    :	Any   	=		i
              holes_repeat[index] += 1

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

    # Returns the sorted array.
       return array


if __name__ == "__main__":
  import doctest

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

