


from itertools import permutations
def 							_UpperCAmelCase    ():
       _A				:	List[Any]       =			list(map("".join    ,							permutations("0123456789"						)						)						)
       return result[999999]


if __name__ == "__main__":
    print(solution())




def 							_UpperCAmelCase    (UpperCamelCase__					:  list    ,							UpperCamelCase__					:  int    ,							UpperCamelCase__					:  int						):
       if right <= left:
              return
       _A				:	str       =			left
       _A				:	List[str]       =			right
       _A				:	Union[str, Any]       =			sorting[left]
       while i <= b:
              if sorting[i] < pivot:
                     _A   ,      _A				:	Union[str, Any]       =			sorting[i], sorting[a]
                     a += 1
                     i += 1
              elif sorting[i] > pivot:
                     _A   ,      _A				:	str       =			sorting[i], sorting[b]
                     b -= 1
              else:
                     i += 1
       quick_sort_apartition(UpperCamelCase__    ,							UpperCamelCase__    ,							a - 1						)
       quick_sort_apartition(UpperCamelCase__    ,							b + 1    ,							UpperCamelCase__						)
def 							_UpperCAmelCase    (UpperCamelCase__					:  list    ,							UpperCamelCase__					:  int    ,							UpperCamelCase__					:  int						):
       if left < right:
              _A				:	Tuple       =			lomuto_partition(UpperCamelCase__    ,							UpperCamelCase__    ,							UpperCamelCase__						)
              quick_sort_lomuto_partition(UpperCamelCase__    ,							UpperCamelCase__    ,							pivot_index - 1						)
              quick_sort_lomuto_partition(UpperCamelCase__    ,							pivot_index + 1    ,							UpperCamelCase__						)
def 							_UpperCAmelCase    (UpperCamelCase__					:  list    ,							UpperCamelCase__					:  int    ,							UpperCamelCase__					:  int						):
       _A				:	Tuple       =			sorting[right]
       _A				:	Tuple       =			left
       for i in range(UpperCamelCase__    ,							UpperCamelCase__						):
              if sorting[i] < pivot:
                     _A   ,      _A				:	int       =			sorting[i], sorting[store_index]
                     store_index += 1
       _A   ,      _A				:	Dict       =			sorting[store_index], sorting[right]
       return store_index
def 							_UpperCAmelCase    (UpperCamelCase__					:  list						):
       if len(UpperCamelCase__						) <= 1:
              return sorting
       return (
           three_way_radix_quicksort([i for i in sorting if i < sorting[0]]						)
           + [i for i in sorting if i == sorting[0]]
           + three_way_radix_quicksort([i for i in sorting if i > sorting[0]]						)
       )


if __name__ == "__main__":
    import doctest

    doctest.testmod(verbose=True)

    lowerCAmelCase__						=			input('Enter numbers separated by a comma:\n').strip()
    lowerCAmelCase__						=			[int(item) for item in user_input.split(',')]
    quick_sort_apartition(unsorted, 0, len(unsorted) - 1)
    print(unsorted)
