



from math import factorial





def 							A			(  _UpperCAmelCase       :     int							,     _UpperCAmelCase       :     int							,     _UpperCAmelCase       :     float					)       ->				float:







			'''simple docstring'''
			if successes > trials:
						raise ValueError('successes must be lower or equal to trials'					)
			if trials < 0 or successes < 0:
						raise ValueError('the function is defined for non-negative integers'					)
			if not isinstance(_UpperCAmelCase							,     _UpperCAmelCase					) or not isinstance(_UpperCAmelCase							,     _UpperCAmelCase					):
						raise ValueError('the function is defined for non-negative integers'					)
			if not 0 < prob < 1:
						raise ValueError('prob has to be in range of 1 - 0'					)
			_UpperCAmelCase	 =     (prob**successes) * ((1 - prob) ** (trials - successes))
			# Calculate the binomial coefficient: n! / k!(n-k)!
			_UpperCAmelCase	 =     float(factorial(_UpperCAmelCase					)					)
			coefficient /= factorial(_UpperCAmelCase					) * factorial(trials - successes					)
			return probability * coefficient


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

							testmod()
							print("Probability of 2 successes out of 4 trails")
							print("with probability of 0.75 is:", end=" ")
							print(binomial_distribution(2, 4, 0.75))





def 							A			(  _UpperCAmelCase       :     list					)       ->				list:







			'''simple docstring'''
			if len(_UpperCAmelCase					) <= 1:
						return lst

			_UpperCAmelCase	 =     1

			while i < len(_UpperCAmelCase					):
						if lst[i - 1] <= lst[i]:
									i += 1
						else:
									_UpperCAmelCase ,  _UpperCAmelCase	 =     lst[i], lst[i - 1]
									i -= 1
									if i == 0:
												_UpperCAmelCase	 =     1

			return lst


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