






"""simple docstring"""




import math






def        lowerCAmelCase (      UpperCamelCase_:							Any     , UpperCamelCase_:							Dict					)       ->							List[str]:







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

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










"""simple docstring"""




def        lowerCAmelCase (      UpperCamelCase_:							Optional[int]     , UpperCamelCase_:							str					)       ->							List[Any]:







  '''simple docstring'''







  _a							=	(boundary[1] - boundary[0]) / steps
  _a							=	boundary[0]
  _a							=	boundary[1]
  _a							=	make_points(UpperCamelCase_     , UpperCamelCase_     , UpperCamelCase_					)
  _a							=	0.0
  y += (h / 2.0) * f(UpperCamelCase_					)
  for i in x_i:
    # print(i)
    y += h * f(UpperCamelCase_					)
  y += (h / 2.0) * f(UpperCamelCase_					)
  return y






def        lowerCAmelCase (      UpperCamelCase_:							str     , UpperCamelCase_:							Any     , UpperCamelCase_:							Any					)       ->							str:







  '''simple docstring'''







  _a							=	a + h
  while x < (b - h):
    yield x
    _a							=	x + h






def        lowerCAmelCase (      UpperCamelCase_:							List[str]					)       ->							int:  # enter your function here







  '''simple docstring'''







  _a							=	(x - 0) * (x - 0)
  return y






def        lowerCAmelCase (      )       ->							Tuple:







  '''simple docstring'''







  _a							=	0.0  # Lower bound of integration
  _a							=	1.0  # Upper bound of integration
  _a							=	10.0  # define number of steps or resolution
  _a							=	[a, b]  # define boundary of integration
  _a							=	method_a(UpperCamelCase_     , UpperCamelCase_					)
  print(f'''y = {y}'''					)


if __name__ == "__main__":
     main()


