





def     __UpperCamelCase						(_SCREAMING_SNAKE_CASE	,		_SCREAMING_SNAKE_CASE	,		_SCREAMING_SNAKE_CASE = 0	,		_SCREAMING_SNAKE_CASE = 0	)       ->     Optional[int]:
  lowercase__			    =						right or len(A__	) - 1
  if left > right:
    return -1
  elif list_data[left] == key:
    return left
  elif list_data[right] == key:
    return right
  else:
    return search(A__	,		A__	,		left + 1	,		right - 1	)


if __name__ == "__main__":
      import doctest

      doctest.testmod()









import math




def     __UpperCamelCase						(_SCREAMING_SNAKE_CASE	,		_SCREAMING_SNAKE_CASE	)       ->     List[Any]:
  if 0 not in (x, y):
    # We use the relation x^y = y*log10(x), where 10 is the base.
    return y * math.logaa(_SCREAMING_SNAKE_CASE	)
  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""")


