class 					A							:


   def __init__(self					:						str	,  __UpperCAmelCase					:						Any		)						->    str:
         """simple docstring"""



         UpperCAmelCase__								=  len(__UpperCAmelCase		)
         UpperCAmelCase__								=  [0] * len_array

         if len_array > 0:
               UpperCAmelCase__								=  array[0]

         for i in range(1	,  __UpperCAmelCase		):
               UpperCAmelCase__								=  self.prefix_sum[i - 1] + array[i]


   def       lowercase_				(self					:						List[Any]	,  __UpperCAmelCase					:						Any	,  __UpperCAmelCase					:						Union[str, Any]		)						->    int:
         """simple docstring"""



         if start == 0:
               return self.prefix_sum[end]

         return self.prefix_sum[end] - self.prefix_sum[start - 1]





   def       lowercase_				(self					:						List[Any]	,  __UpperCAmelCase					:						List[Any]		)						->    Optional[int]:
         """simple docstring"""



         UpperCAmelCase__								=  {0}
         for sum_item in self.prefix_sum:
               if sum_item - target_sum in sums:
                     return True

               sums.add(__UpperCAmelCase		)

         return False


if __name__ == "__main__":
      import doctest

      doctest.testmod()

from __future__ import annotations




def        lowerCAmelCase_			(					__A							)					->    list[int]:







      '''simple docstring'''


      if len(__A							) == 0:
            return array

      UpperCAmelCase__		,				UpperCAmelCase__								=  min(__A							), max(__A							)

      # 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(__A							):
            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()
      UpperCamelCase__    							= input('Enter numbers separated by comma:\n')
      UpperCamelCase__    							= [int(x) for x in user_input.split(',')]
      print(pigeon_sort(unsorted))



