
import sys




def 				__magic_name__				(     __lowerCAmelCase			:		int	,						__lowerCAmelCase			:		list[int]							)    ->     int:
				if not numbers:
								return 0
				if target == 0 and target in numbers:
								return 0
				if not isinstance(__lowerCAmelCase	,						(list, tuple)							) or not all(
				    isinstance(__lowerCAmelCase	,						__lowerCAmelCase							) for number in numbers							):
								raise ValueError('''numbers must be an iterable of integers'''							)

				__lowerCamelCase					      =			__lowerCamelCase					      =			__lowerCamelCase					      =			0
				__lowerCamelCase					      =			sys.maxsize

				while right < len(__lowerCAmelCase							):
								curr_sum += numbers[right]
								while curr_sum >= target and left <= right:
												__lowerCamelCase					      =			min(__lowerCAmelCase	,						right - left + 1							)
												curr_sum -= numbers[left]
												left += 1
								right += 1

				return 0 if min_len == sys.maxsize else min_len




def 				__magic_name__				(     __lowerCAmelCase			:		list	,						__lowerCAmelCase			:		int	,						__lowerCAmelCase			:		int	,						__lowerCAmelCase			:		int							)    ->     int:
				__lowerCamelCase					      =			int((lower_bound + upper_bound) // 2							)
				if array[r] == value:
								return r
				if lower_bound >= upper_bound:
								return -1
				if array[r] < value:
								return binary_search(__lowerCAmelCase	,						r + 1	,						__lowerCAmelCase	,						__lowerCAmelCase							)
				else:
								return binary_search(__lowerCAmelCase	,						__lowerCAmelCase	,						r - 1	,						__lowerCAmelCase							)




def 				__magic_name__				(     __lowerCAmelCase			:		int	,						__lowerCAmelCase			:		list							)    ->     list:
				__lowerCamelCase					      =			0
				if matrix[index][0] == value:
								return [index, 0]
				while index < len(__lowerCAmelCase							) and matrix[index][0] < value:
								__lowerCamelCase					      =			binary_search(matrix[index]	,						0	,						len(matrix[index]							) - 1	,						__lowerCAmelCase							)
								if r != -1:
												return [index, r]
								index += 1
				return [-1, -1]


if __name__ == "__main__":
					import doctest

					doctest.testmod()



