




import math





def __UpperCamelCase			(       _A ,  _A  ):

						if 0 not in (x, y):
												# We use the relation x^y = y*log10(x), where 10 is the base.
												return y * math.logaa(__a  )
						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.
						_A     =			'''Enter the base and the power separated by a comma: '''
						_A   ,	_A     =			map(int, input(prompt).split(''','''))
						_A   ,	_A     =			map(int, input(prompt).split(''','''))

						# We find the log of each number, using the function res(), which takes two
						# arguments.
						_A     =			res(xa, ya)
						_A     =			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    __UpperCAmelCase (	__a      :			str	)			->     int:

					"""simple docstring"""

					assert column_title.isupper()
					_a	:    Optional[Any]         =		0
					_a	:    List[Any]         =		len(__a	) - 1
					_a	:    List[str]         =		0

					while index >= 0:
										_a	:    Dict         =		(ord(column_title[index]	) - 64) * pow(26		,__a	)
										answer += value
										power += 1
										index -= 1

					return answer


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

			testmod()



