





def 							a_	(    __magic_name__   )				->			int:




				"""simple docstring"""






				def merge(__magic_name__		,     __magic_name__   ) -> list:

								def _merge():
												while left and right:
																yield (left if left[0] <= right[0] else right).pop(0   )
												yield from left
												yield from right

								return list(_merge()   )

				if len(lowerCamelCase_   ) <= 1:
								return collection
				snake_case   :					int    						=				len(lowerCamelCase_   ) // 2
				return merge(merge_sort(collection[:mid]   )		,     merge_sort(collection[mid:]   )   )


if __name__ == "__main__":
			import doctest

			doctest.testmod()
			_a     :    Any         =						input('Enter numbers separated by a comma:\n').strip()
			_a     :    Optional[int]         =						[int(item) for item in user_input.split(',')]
			print(*merge_sort(unsorted), sep=',')







'''simple docstring'''




from math import factorial



def 		__A		(  lowerCamelCase_			,			lowerCamelCase_	):


		"""simple docstring"""



		if n < k or k < 0:
				raise ValueError("""Please enter positive integers for n and k where n >= k"""	)
		return factorial(lowerCamelCase_	) // (factorial(lowerCamelCase_	) * factorial(n - k	))


if __name__ == "__main__":
							print(
							    """The number of five-card hands possible from a standard""",
							    f'''fifty-two card deck is: {combinations(52, 5)}\n''',
							)

							print(
							    """If a class of 40 students must be arranged into groups of""",
							    f'''4 for group projects, there are {combinations(40, 4)} ways''',
							    """to arrange them.\n""",
							)

							print(
							    """If 10 teams are competing in a Formula One race, there""",
							    f'''are {combinations(10, 3)} ways that first, second and''',
							    """third place can be awarded.""",
							)



