


def       UpperCamelCase__     (  SCREAMING_SNAKE_CASE__			,       SCREAMING_SNAKE_CASE__						):
 if n == 0:
  return 1

 elif n % 2 == 1:
  return binary_exponentiation(SCREAMING_SNAKE_CASE__			,       n - 1						) * a

 else:
  __lowerCamelCase		:							Union[str, Any]							=						binary_exponentiation(SCREAMING_SNAKE_CASE__			,       n / 2						)
  return b * b


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

       lowercase_           =	binary_exponentiation(BASE, POWER)
       print(F"""{BASE}^({POWER}) : {RESULT}""")





from __future__ import annotations
def       UpperCamelCase__     (  SCREAMING_SNAKE_CASE__			,       SCREAMING_SNAKE_CASE__			,       SCREAMING_SNAKE_CASE__			,       SCREAMING_SNAKE_CASE__						):
 __lowerCamelCase					,     __lowerCamelCase		:							str							=						m - 1, 0
 while i >= 0 and j < n:
  if key == mat[i][j]:
   print(f'Key {key} found at row- {i + 1} column- {j + 1}'						)
   return
  if key < mat[i][j]:
   i -= 1
  else:
   j += 1
 print(f'Key {key} not found'						)
def       UpperCamelCase__     (  ):
 __lowerCamelCase		:							List[Any]							=						[[2, 5, 7], [4, 8, 13], [9, 11, 15], [12, 17, 20]]
 __lowerCamelCase		:							int							=						int(input('Enter the element to be searched:'						)						)
 print(SCREAMING_SNAKE_CASE__						)
 search_in_a_sorted_matrix(SCREAMING_SNAKE_CASE__			,       len(SCREAMING_SNAKE_CASE__						)			,       len(mat[0]						)			,       SCREAMING_SNAKE_CASE__						)


if __name__ == "__main__":
       import doctest

       doctest.testmod()
       main()

