





def 							__snake_case							(    lowerCAmelCase_ ,							lowerCAmelCase_ = " "	)				->						list:
    SCREAMING_SNAKE_CASE__											=			[]

    SCREAMING_SNAKE_CASE__											=			0
    for index, char in enumerate(lowerCAmelCase_	):
        if char == separator:
            split_words.append(string[last_index:index]	)
            SCREAMING_SNAKE_CASE__											=			index + 1
        elif index + 1 == len(lowerCAmelCase_	):
            split_words.append(string[last_index : index + 1]	)
    return split_words


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

  testmod()








"""simple docstring"""


import math


def        UpperCAmelCase      (					a__     ,      a__ ):





						'''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(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.
		__SCREAMING_SNAKE_CASE   =   'Enter the base and the power separated by a comma: '
		__SCREAMING_SNAKE_CASE,						__SCREAMING_SNAKE_CASE   =   map(int, input(prompt).split(','))
		__SCREAMING_SNAKE_CASE,						__SCREAMING_SNAKE_CASE   =   map(int, input(prompt).split(','))

		# We find the log of each number, using the function res(), which takes two
		# arguments.
		__SCREAMING_SNAKE_CASE   =   res(xa, ya)
		__SCREAMING_SNAKE_CASE   =   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')