
from __future__ import annotations




def        __UpperCamelCase					(    lowerCAmelCase__							:    list[int]  ):
 if len(lowerCAmelCase__  ) == 0:
  return array

 __a    ,	__a			:  Optional[int]		    =  min(lowerCAmelCase__  ), max(lowerCAmelCase__  )

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

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

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

    # Returns the sorted array.
 return array


if __name__ == "__main__":
      import doctest

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


from transformers import BertTokenizerFast

from .custom_tokenization import CustomTokenizer



class 		UpperCamelCase__  (	__lowercase   ):
   _SCREAMING_SNAKE_CASE				:							Union[str, Any]     	=				CustomTokenizer
   pass
