

"""simple docstring"""






def 		A_	(   __UpperCamelCase     :				list       ,	__UpperCamelCase     :				int       ,	__UpperCamelCase     :				int       ,	__UpperCamelCase     :				int				):
		lowercase										=							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(__UpperCamelCase       ,	r + 1       ,	__UpperCamelCase       ,	__UpperCamelCase				)
		else:
				return binary_search(__UpperCamelCase       ,	__UpperCamelCase       ,	r - 1       ,	__UpperCamelCase				)
def 		A_	(   __UpperCamelCase     :				int       ,	__UpperCamelCase     :				list				):
		lowercase										=							0
		if matrix[index][0] == value:
				return [index, 0]
		while index < len(__UpperCamelCase				) and matrix[index][0] < value:
				lowercase										=							binary_search(matrix[index]       ,	0       ,	len(matrix[index]				) - 1       ,	__UpperCamelCase				)
				if r != -1:
						return [index, r]
				index += 1
		return [-1, -1]


if __name__ == "__main__":
							import doctest

							doctest.testmod()


"""simple docstring"""






from typing import TYPE_CHECKING

from ...utils import _LazyModule


__lowerCAmelCase				      =   {'''tokenization_phobert''': ['''PhobertTokenizer''']}


if TYPE_CHECKING:
							from .tokenization_phobert import PhobertTokenizer

else:
							import sys

							__lowerCAmelCase				      =   _LazyModule(__name__, globals()['''__file__'''], _import_structure, module_spec=__spec__)