



import math






def      _A				(UpperCamelCase		:      Tuple      ,			UpperCamelCase		:      List[Any] )  ->Tuple:



			'''simple docstring'''







			if 0 not in (x, y):
						# We use the relation x^y = y*log10(x), where 10 is the base.
						return y * math.logaa(UpperCamelCase )
			else:
						if x == 0:  # 0 raised to any number is 0
									return 0
						elif y == 0:
									return 1  # any number raised to 0 is 1
			raise AssertionError("""This should never happen""" )


if __name__ == "__main__":  # Main function
				# Read two numbers from input and typecast them to int using map function.
				# Here x is the base and y is the power.
				_lowercase     							=						'''Enter the base and the power separated by a comma: '''
				_lowercase							,				_lowercase     							=						map(int, input(prompt).split(''','''))
				_lowercase							,				_lowercase     							=						map(int, input(prompt).split(''','''))

				# We find the log of each number, using the function res(), which takes two
				# arguments.
				_lowercase     							=						res(xa, ya)
				_lowercase     							=						res(xa, ya)

				# We check for the largest number
				if resa > resa:
								print('''Largest number is''', xa, '''^''', ya)
				elif resa > resa:
								print('''Largest number is''', xa, '''^''', ya)
				else:
								print('''Both are equal''')








def      _A				(UpperCamelCase		:      List[Any]      ,			UpperCamelCase		:      Dict )  ->List[str]:



			'''simple docstring'''







			lowerCamelCase__ :      int								=		[1]
			for i in range(2      ,			UpperCamelCase ):
						factorials.append(factorials[-1] * i )
			assert 0 <= k < factorials[-1] * n, "k out of bounds"

			lowerCamelCase__ :      Union[str, Any]								=		[]
			lowerCamelCase__ :      Optional[Any]								=		list(range(UpperCamelCase ) )

			# Find permutation
			while factorials:
						lowerCamelCase__ :      Union[str, Any]								=		factorials.pop()
						lowerCamelCase__							,lowerCamelCase__ :      Union[str, Any]								=		divmod(UpperCamelCase      ,			UpperCamelCase )
						permutation.append(elements[number] )
						elements.remove(elements[number] )
			permutation.append(elements[0] )

			return permutation


if __name__ == "__main__":
				import doctest

				doctest.testmod()



