


__UpperCAmelCase : List[Any] 			=				[4, 1, 7, 4, 2, 6, 4, 1, 5, 3, 7, 5]
__UpperCAmelCase : List[str] 			=				[3, 7, 7, 4, 2, 6, 4, 1, 5, 3, 7, 5]
__UpperCAmelCase : Union[str, Any] 			=				{
    0: """Sunday""",
    1: """Monday""",
    2: """Tuesday""",
    3: """Wednesday""",
    4: """Thursday""",
    5: """Friday""",
    6: """Saturday""",
}


def      a	(							SCREAMING_SNAKE_CASE_      :		List[str]							,			SCREAMING_SNAKE_CASE_      :		List[Any]							,			SCREAMING_SNAKE_CASE_      :		Optional[Any]       ):






       """simple docstring"""





       assert len(str(SCREAMING_SNAKE_CASE_       )       ) > 2, "year should be in YYYY format"
       assert 1 <= month <= 1_2, "month should be between 1 to 12"
       assert 1 <= day <= 3_1, "day should be between 1 to 31"

       # Doomsday algorithm:
       UpperCamelCase    :	Tuple   	=		year // 1_0_0
       UpperCamelCase    :	Union[str, Any]   	=		(5 * (century % 4) + 2) % 7
       UpperCamelCase    :	List[str]   	=		year % 1_0_0
       UpperCamelCase    :	Union[str, Any]   	=		centurian % 1_2
       UpperCamelCase    :	Dict   	=		(
           (centurian // 1_2) + centurian_m + (centurian_m // 4) + century_anchor
       ) % 7
       UpperCamelCase    :	Any   	=		(
           DOOMSDAY_NOT_LEAP[month - 1]
           if (year % 4 != 0) or (centurian == 0 and (year % 4_0_0) == 0)
           else DOOMSDAY_LEAP[month - 1]
       )
       UpperCamelCase    :	List[str]   	=		(dooms_day + day - day_anchor) % 7
       return WEEK_DAY_NAMES[week_day]


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))

