'''simple docstring'''







def 		_lowercase		(     lowercase_						,							lowercase_						,							lowercase_						,							lowercase_  ):



		'''simple docstring'''







		_snake_case     	=	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(lowercase_						,							r + 1						,							lowercase_						,							lowercase_  )
		else:
				return binary_search(lowercase_						,							lowercase_						,							r - 1						,							lowercase_  )






def 		_lowercase		(     lowercase_						,							lowercase_  ):



		'''simple docstring'''







		_snake_case     	=	0
		if matrix[index][0] == value:
				return [index, 0]
		while index < len(lowercase_  ) and matrix[index][0] < value:
				_snake_case     	=	binary_search(matrix[index]						,							0						,							len(matrix[index]  ) - 1						,							lowercase_  )
				if r != -1:
						return [index, r]
				index += 1
		return [-1, -1]


if __name__ == "__main__":
						import doctest

						doctest.testmod()











'''simple docstring'''







import math





class 					lowerCamelCase_							:




					'''simple docstring'''






					def __init__(   self,  __UpperCamelCase,  __UpperCamelCase,  __UpperCamelCase			):
							_snake_case     	=	x
							_snake_case     	=	y
							_snake_case     	=	z






					def __repr__(   self			):
							return f'''Point({self.x}, {self.y}, {self.z})'''






def 		_lowercase		(     lowercase_						,							lowercase_  ):



		'''simple docstring'''







		return math.sqrt(abs((b.x - a.x) ** 2 + (b.y - a.y) ** 2 + (b.z - a.z) ** 2  )  )


if __name__ == "__main__":
						import doctest

						doctest.testmod()





