






import math

def   __lowercase       (			snake_case,	snake_case			):







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

					# We find the log of each number, using the function res(), which takes two
					# arguments.
					SCREAMING_SNAKE_CASE__   :      List[Any]				=		res(xa, ya)
					SCREAMING_SNAKE_CASE__   :      Dict				=		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__					(			__A  :						str     ,				__A  :						str			)					->str:

      if not (isinstance(__A     ,				__A			) and isinstance(__A     ,				__A			)):
            raise ValueError('''longest_common_substring() takes two strings for inputs'''			)

      __A    =len(__A			)
      __A    =len(__A			)

      __A    =[[0] * (texta_length + 1) for _ in range(texta_length + 1			)]
      __A    =0
      __A    =0

      for i in range(1     ,				texta_length + 1			):
            for j in range(1     ,				texta_length + 1			):
                  if texta[i - 1] == texta[j - 1]:
                        __A    =1 + dp[i - 1][j - 1]
                        if dp[i][j] > ans_length:
                              __A    =i
                              __A    =dp[i][j]

      return texta[ans_index - ans_length : ans_index]


if __name__ == "__main__":
   import doctest

   doctest.testmod()


