

"""simple docstring"""





from __future__ import annotations

from random import randrange




def     _A    (    UpperCamelCase_	:			list)      ->		list:
   '''simple docstring'''


   if len(_A) < 2:
      return collection
   __lowercase								=		randrange(len(_A))  # Use random element as pivot
   __lowercase								=		collection[pivot_index]
   __lowercase								=		[]  # All elements greater than pivot
   __lowercase								=		[]  # All elements less than or equal to pivot

   for element in collection[:pivot_index]:
      (greater if element > pivot else lesser).append(_A)

   for element in collection[pivot_index + 1 :]:
      (greater if element > pivot else lesser).append(_A)

   return [*quick_sort(_A), pivot, *quick_sort(_A)]


if __name__ == "__main__":
   _a					 =				input('Enter numbers separated by a comma:\n').strip()
   _a					 =				[int(item) for item in user_input.split(',')]
   print(quick_sort(unsorted))







from math import factorial




def        __UpperCamelCase     (      _A					:							Union[str, Any]      ,  _A					:							Tuple		)				->Any:



							"""simple docstring"""
							return factorial(_A		) / (factorial(_A		) * factorial(n - r		))




def        __UpperCamelCase     (      )				->Any:



							"""simple docstring"""
							lowerCamelCase_								=0

							for i in range(1      ,  101		):
														for j in range(1      ,  i + 1		):
																					if combinations(_A      ,  _A		) > 1E6:
																												total += 1
							return total


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