


def        __lowerCAmelCase    (SCREAMING_SNAKE_CASE					,					SCREAMING_SNAKE_CASE					,					SCREAMING_SNAKE_CASE					,					SCREAMING_SNAKE_CASE					)->  int:




      """simple docstring"""

      snake_case_       =      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(SCREAMING_SNAKE_CASE					,					r + 1					,					SCREAMING_SNAKE_CASE					,					SCREAMING_SNAKE_CASE					)
      else:
            return binary_search(SCREAMING_SNAKE_CASE					,					SCREAMING_SNAKE_CASE					,					r - 1					,					SCREAMING_SNAKE_CASE					)






def        __lowerCAmelCase    (SCREAMING_SNAKE_CASE					,					SCREAMING_SNAKE_CASE					)->  list:




      """simple docstring"""

      snake_case_       =      0
      if matrix[index][0] == value:
            return [index, 0]
      while index < len(SCREAMING_SNAKE_CASE					) and matrix[index][0] < value:
            snake_case_       =      binary_search(matrix[index]					,					0					,					len(matrix[index]					) - 1					,					SCREAMING_SNAKE_CASE					)
            if r != -1:
                  return [index, r]
            index += 1
      return [-1, -1]


if __name__ == "__main__":
   import doctest

   doctest.testmod()



def        __lowerCAmelCase    (SCREAMING_SNAKE_CASE = 1000					)->  int:




      """simple docstring"""

      snake_case_       =      0
      snake_case_       =      (n - 1) // 3
      total += ((terms) * (6 + (terms - 1) * 3)) // 2  # total of an A.P.
      snake_case_       =      (n - 1) // 5
      total += ((terms) * (10 + (terms - 1) * 5)) // 2
      snake_case_       =      (n - 1) // 15
      total -= ((terms) * (30 + (terms - 1) * 15)) // 2
      return total


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