
import math





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

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





from __future__ import annotations





def 	SCREAMING_SNAKE_CASE__    (      __lowerCAmelCase    ,		__lowerCAmelCase							):
    snake_case__						,					snake_case__						=				set(__lowerCAmelCase							), [start]

    while stack:
        snake_case__						=				stack.pop()
        explored.add(__lowerCAmelCase							)
        # Differences from BFS:
        # 1) pop last element instead of first one
        # 2) add adjacent elements to stack without exploring them
        for adj in reversed(graph[v]							):
            if adj not in explored:
                stack.append(__lowerCAmelCase							)
    return explored


__magic_name__            =  {
    '''A''': ['''B''', '''C''', '''D'''],
    '''B''': ['''A''', '''D''', '''E'''],
    '''C''': ['''A''', '''F'''],
    '''D''': ['''B''', '''D'''],
    '''E''': ['''B''', '''F'''],
    '''F''': ['''C''', '''E''', '''G'''],
    '''G''': ['''F'''],
}

if __name__ == "__main__":
     import doctest

     doctest.testmod()
     print(depth_first_search(G, '''A'''))



