



def 				UpperCAmelCase__		(					_SCREAMING_SNAKE_CASE :						Optional[Any]  ,					_SCREAMING_SNAKE_CASE :						Dict  ,					_SCREAMING_SNAKE_CASE :						Optional[int]  ,					_SCREAMING_SNAKE_CASE :						Union[str, Any]					)->List[Any]:
      _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(__lowercase  ,					r + 1  ,					__lowercase  ,					__lowercase					)
      else:
            return binary_search(__lowercase  ,					__lowercase  ,					r - 1  ,					__lowercase					)
def 				UpperCAmelCase__		(					_SCREAMING_SNAKE_CASE :						str  ,					_SCREAMING_SNAKE_CASE :						str					)->Optional[Any]:
      _lowerCAmelCase			      =	0
      if matrix[index][0] == value:
            return [index, 0]
      while index < len(__lowercase					) and matrix[index][0] < value:
            _lowerCAmelCase			      =	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()



def   snake_case_    (			__lowercase      ,							__lowercase      ,							__lowercase      ,							__lowercase							):
   UpperCAmelCase_				:   Optional[int]							= 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   snake_case_    (			__lowercase      ,							__lowercase							):
   UpperCAmelCase_				:   Union[str, Any]							= 0
   if matrix[index][0] == value:
      return [index, 0]
   while index < len(__lowercase							) and matrix[index][0] < value:
      UpperCAmelCase_				:   str							= 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()