






from __future__ import annotations







def 					SCREAMING_SNAKE_CASE    (			snake_case_ :							list[int]					,  snake_case_ :							int       ):
	snake_case__			:				Any       =  0
	snake_case__			:				Optional[int]       =  len(snake_case_       ) - 1

	while i < j:
		if nums[i] + nums[j] == target:
			return [i, j]
		elif nums[i] + nums[j] < target:
			snake_case__			:				int       =  i + 1
		else:
			snake_case__			:				Dict       =  j - 1

	return []


if __name__ == "__main__":
	import doctest

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











__lowerCamelCase :      Optional[int]										=				"""Tobias Carryer"""

from time import time



class 							SCREAMING_SNAKE_CASE__						:





					"""simple docstring"""






					def __init__( self					:  List[Any]							,		__A					:  List[Any]							,		__A					:  Optional[int]							,		__A					:  List[str]							,		__A					:  Dict=int(time()	)	):  # noqa: B008
						snake_case__			:				List[Any]       =  multiplier
						snake_case__			:				Optional[int]       =  increment
						snake_case__			:				Optional[int]       =  modulo
						snake_case__			:				Union[str, Any]       =  seed






					def 	_lowercase					( self					:  str	):
						snake_case__			:				Union[str, Any]       =  (self.multiplier * self.seed + self.increment) % self.modulo
						return self.seed


if __name__ == "__main__":
	# Show the LCG in action.
	__lowerCamelCase :      int										=				LinearCongruentialGenerator(166_4525, 10_1390_4223, 2 << 31)
	while True:
		print(lcg.next_number())



