


'''simple docstring'''






def 					_snake_case   (     A ,    A       )						->    str:
							lowerCAmelCase__          =	1
							while b > 0:
														if b & 1:
																					res *= a

														a *= a
														b >>= 1

							return res


def 					_snake_case   (     A ,    A ,    A       )						->    List[Any]:
							lowerCAmelCase__          =	1
							while b > 0:
														if b & 1:
																					lowerCAmelCase__          =	((res % c) * (a % c)) % c

														a *= a
														b >>= 1

							return res



'''simple docstring'''






from __future__ import annotations


def 					_snake_case   (     A ,    A       )						->    list[int]:
							lowerCAmelCase__          =	{}
							for index, val in enumerate(A       ):
														lowerCAmelCase__          =	target - val
														if compl in chk_map:
																					return [chk_map[compl], index]
														lowerCAmelCase__          =	index
							return []


if __name__ == "__main__":
		import doctest

		doctest.testmod()
		print(f"""{two_sum([2, 7, 11, 15], 9) = }""")