code: def 					__lowerCAmelCase			(  _A ,_A ,_A ,_A					):
  
  
  
  							"""simple docstring"""
  
  
  							_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(_A ,r + 1 ,_A ,_A					)
  							else:
  														return binary_search(_A ,_A ,r - 1 ,_A					)
  
  
  def 					__lowerCAmelCase			(  _A ,_A					):
  
  
  
  							"""simple docstring"""
  
  
  							_lowercase				=	0
  							if matrix[index][0] == value:
  														return [index, 0]
  							while index < len(_A					) and matrix[index][0] < value:
  														_lowercase				=	binary_search(matrix[index] ,0 ,len(matrix[index]					) - 1 ,_A					)
  														if r != -1:
  																					return [index, r]
  														index += 1
  							return [-1, -1]
  
  
  if __name__ == "__main__":
  				import doctest
  
  				doctest.testmod()
  
  
  
style_context: def 					__lowerCAmelCase			(  _A = 998_001					):
  
  
  
  							"""simple docstring"""
  
  
  							_lowercase				=	0
  							for i in range(999 ,99 ,-1					):  # 3 digit numbers range from 999 down to 100
  														for j in range(999 ,99 ,-1					):
  																					_lowercase				=	str(i * j					)
  																					if product_string == product_string[::-1] and i * j < n:
  																												_lowercase				=	max(_A ,i * j					)
  							return answer
  
  
  if __name__ == "__main__":
  				print(F'''{solution() = }''')
  
  
  