





from __future__ import annotations







def   __lowerCamelCase   (				__a  :int | float | str       ,	__a  :int | float | str       )						->							list[str]:






		"""simple docstring"""

		if nth_term == "":
				return [""]
		A__     =  int(__a       )
		A__     =  int(__a       )
		A__     =  []
		for temp in range(int(__a       )       ):
				series.append(F'1 / {pow(temp + 1       ,	int(__a       )       )}' if series else """1"""       )
		return series


if __name__ == "__main__":
					import doctest

					doctest.testmod()

					A       :   List[str]					= int(input('''Enter the last number (nth term) of the P-Series'''))
					A       :   Dict					= int(input('''Enter the power for  P-Series'''))
					print('''Formula of P-Series => 1+1/2^p+1/3^p ..... 1/n^p''')
					print(p_series(nth_term, power))










def   __lowerCamelCase   (				__a  :Optional[Any]       )						->							Tuple:






		"""simple docstring"""

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


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



