



"""simple docstring"""
import math
def    A_  (			_lowercase,					_lowercase	):







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

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





import random

def   __SCREAMING_SNAKE_CASE  (      A_						,     A_ ):
	lowerCAmelCase__				,lowerCAmelCase__				,lowerCAmelCase__	:						Optional[int]  				=	[], [], []
	for element in data:
		if element < pivot:
			less.append(A_ )
		elif element > pivot:
			greater.append(A_ )
		else:
			equal.append(A_ )
	return less, equal, greater





def   __SCREAMING_SNAKE_CASE  (      A_						,     A_ ):
	# index = len(items) // 2 when trying to find the median
	#   (value of index when items is sorted)

	# invalid input
	if index >= len(A_ ) or index < 0:
		return None

	lowerCAmelCase__	:						str  				=	items[random.randint(0						,     len(A_ ) - 1 )]
	lowerCAmelCase__	:						Optional[Any]  				=	0
	lowerCAmelCase__				,lowerCAmelCase__				,lowerCAmelCase__	:						Any  				=	_partition(A_						,     A_ )
	lowerCAmelCase__	:						str  				=	len(A_ )
	lowerCAmelCase__	:						Optional[Any]  				=	len(A_ )

	# index is the pivot
	if m <= index < m + count:
		return pivot
	# must be in smaller
	elif m > index:
		return quick_select(A_						,     A_ )
	# must be in larger
	else:
		return quick_select(A_						,     index - (m + count) )




