code: 
  
  
  
  def  __a  (					lowerCAmelCase_     :      List[Any]    ,lowerCAmelCase_     :      str    ,lowerCAmelCase_     :      Dict    ,lowerCAmelCase_     :      Dict       )   ->				int:
  
  
  
  
  
  
  						'''simple docstring'''
  
  
  
  						UpperCAmelCase_=     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  __a  (					lowerCAmelCase_     :      str    ,lowerCAmelCase_     :      int       )   ->				Optional[Any]:
  
  
  
  
  
  
  						'''simple docstring'''
  
  
  
  						UpperCAmelCase_=     0
  						if matrix[index][0] == value:
  												return [index, 0]
  						while index < len(lowercase__       ) and matrix[index][0] < value:
  												UpperCAmelCase_=     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()
  
  
  
  
  
style_context: 
  
  
  
  from .prime_check import Test
  
  Test()
  
  
  
  
  