
def 							__SCREAMING_SNAKE_CASE       (		SCREAMING_SNAKE_CASE	:				str   ,							SCREAMING_SNAKE_CASE	:				Optional[Any]   ,							SCREAMING_SNAKE_CASE	:				str      )					->						List[str]:





				if right <= left:
								return
				__lowercase								= __lowercase								= left
				__lowercase								= right
				__lowercase								= sorting[left]
				while i <= b:
								if sorting[i] < pivot:
												__lowercase		, __lowercase								= sorting[i], sorting[a]
												a += 1
												i += 1
								elif sorting[i] > pivot:
												__lowercase		, __lowercase								= sorting[i], sorting[b]
												b -= 1
								else:
												i += 1
				quick_sort_apartition(_A   ,							_A   ,							a - 1      )
				quick_sort_apartition(_A   ,							b + 1   ,							_A      )




def 							__SCREAMING_SNAKE_CASE       (		SCREAMING_SNAKE_CASE	:				List[Any]   ,							SCREAMING_SNAKE_CASE	:				Optional[Any]   ,							SCREAMING_SNAKE_CASE	:				List[str]      )					->						Tuple:





				if left < right:
								__lowercase								= lomuto_partition(_A   ,							_A   ,							_A      )
								quick_sort_lomuto_partition(_A   ,							_A   ,							pivot_index - 1      )
								quick_sort_lomuto_partition(_A   ,							pivot_index + 1   ,							_A      )




def 							__SCREAMING_SNAKE_CASE       (		SCREAMING_SNAKE_CASE	:				Tuple   ,							SCREAMING_SNAKE_CASE	:				List[Any]   ,							SCREAMING_SNAKE_CASE	:				Dict      )					->						Optional[int]:
				__lowercase								= sorting[right]
				__lowercase								= left
				for i in range(_A   ,							_A      ):
								if sorting[i] < pivot:
												__lowercase		, __lowercase								= sorting[i], sorting[store_index]
												store_index += 1
				__lowercase		, __lowercase								= sorting[store_index], sorting[right]
				return store_index




def 							__SCREAMING_SNAKE_CASE       (		SCREAMING_SNAKE_CASE	:				int      )					->						Optional[int]:





				if len(_A      ) <= 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)

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








from math import pi




def 							__SCREAMING_SNAKE_CASE       (		SCREAMING_SNAKE_CASE	:				float      )					->						float:
				return degree / (180 / pi)


if __name__ == "__main__":
							from doctest import testmod

							testmod()





