

def 						UpperCamelCase_(			snake_case__:  Union[str, Any]  ,    snake_case__:  List[Any]  ,    snake_case__:  str   )       -> Union[str, Any]:
 assert b != 0, "This cannot accept modulo that is == 0"
 if n == 0:
  return 1

 if n % 2 == 1:
  return (bin_exp_mod(snake_case__  ,    n - 1  ,    snake_case__   ) * a) % b

 UpperCAmelCase__							=				bin_exp_mod(snake_case__  ,    n / 2  ,    snake_case__   )
 return (r * r) % b


if __name__ == "__main__":
 try:
  _UpperCamelCase			       =			int(input('''Enter Base : ''').strip())
  _UpperCamelCase			       =			int(input('''Enter Power : ''').strip())
  _UpperCamelCase			       =			int(input('''Enter Modulo : ''').strip())
 except ValueError:
  print('''Invalid literal for integer''')

 print(bin_exp_mod(BASE, POWER, MODULO))










"""simple docstring"""





def 		lowerCAmelCase_	(  lowercase_   :							Any		):

 '''simple docstring'''






 __SCREAMING_SNAKE_CASE :			Optional[int]												=       len(lowercase_		)
 for i in range(length - 1		):
  __SCREAMING_SNAKE_CASE :			str												=       False
  for j in range(length - 1 - i		):
   if collection[j] > collection[j + 1]:
    __SCREAMING_SNAKE_CASE :			Any												=       True
    __SCREAMING_SNAKE_CASE							,      __SCREAMING_SNAKE_CASE :			List[str]												=       collection[j + 1], collection[j]
  if not swapped:
   break  # Stop iteration if the collection is sorted.
 return collection


if __name__ == "__main__":
    import doctest
    import time

    doctest.testmod()

    _lowerCamelCase       =	input('''Enter numbers separated by a comma:''').strip()
    _lowerCamelCase       =	[int(item) for item in user_input.split(''',''')]
    _lowerCamelCase       =	time.process_time()
    print(*bubble_sort(unsorted), sep=''',''')
    print(f'Processing time: {(time.process_time() - start)%1e9 + 7}')

