



'''simple docstring'''





def  a_  (							_lowerCAmelCase ,_lowerCAmelCase ,_lowerCAmelCase ,_lowerCAmelCase )   ->   int:
  __lowerCamelCase : Tuple					 =				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(_lowerCAmelCase ,r + 1 ,_lowerCAmelCase ,_lowerCAmelCase )
  else:
    return binary_search(_lowerCAmelCase ,_lowerCAmelCase ,r - 1 ,_lowerCAmelCase )

def  a_  (							_lowerCAmelCase ,_lowerCAmelCase )   ->   list:
  __lowerCamelCase : Optional[Any]					 =				0
  if matrix[index][0] == value:
    return [index, 0]
  while index < len(_lowerCAmelCase ) and matrix[index][0] < value:
    __lowerCamelCase : Any					 =				binary_search(matrix[index] ,0 ,len(matrix[index] ) - 1 ,_lowerCAmelCase )
    if r != -1:
      return [index, r]
    index += 1
  return [-1, -1]


if __name__ == "__main__":
   import doctest

   doctest.testmod()











'''simple docstring'''





def  a_  (							_lowerCAmelCase = 1000 )   ->   int:
  return sum(i for i in range(_lowerCAmelCase ) if i % 3 == 0 or i % 5 == 0 )


if __name__ == "__main__":
   print(f'''{solution() = }''')






