






from collections.abc import Sequence




def       _SCREAMING_SNAKE_CASE (							__snake_case   ,      __snake_case )				->						float:
       return sum(c * (x**i) for i, c in enumerate(__snake_case ) )




def       _SCREAMING_SNAKE_CASE (							__snake_case   ,      __snake_case )				->						float:
       _UpperCAmelCase							=    0.0
       for coeff in reversed(__snake_case ):
              _UpperCAmelCase							=    result * x + coeff
       return result


if __name__ == "__main__":
  __a:     str   					=					(0.0, 0.0, 5.0, 9.3, 7.0)
  __a:     List[str]   					=					1_0.0
  print(evaluate_poly(poly, x))
  print(horner(poly, x))

def    a      ( a	)     ->List[Any]:




			'''simple docstring'''


			SCREAMING_SNAKE_CASE     						= len(a	)
			while cur > 1:
						# Find the maximum number in arr
						SCREAMING_SNAKE_CASE     						= arr.index(max(arr[0:cur]	)	)
						# Reverse from 0 to mi
						SCREAMING_SNAKE_CASE     						= arr[mi::-1] + arr[mi + 1 : len(a	)]
						# Reverse whole list
						SCREAMING_SNAKE_CASE     						= arr[cur - 1 :: -1] + arr[cur : len(a	)]
						cur -= 1
			return arr


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