
'''simple docstring'''







def   lowerCAmelCase(  a__    :  int = 1000      ):







       '''simple docstring'''






       lowerCamelCase__				   =      0
       for i in range(a__      ):
              if i % 3 == 0 or i % 5 == 0:
                     result += i
       return result


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



'''simple docstring'''







def   lowerCAmelCase(  a__    :  float      , a__    :  float      , a__    :  int      ):







       '''simple docstring'''






       lowerCamelCase__				   =      [1 / first_term]
       lowerCamelCase__				   =      1 / first_term
       for _ in range(number_of_terms - 1      ):
              first_term += common_difference
              arithmetic_progression.append(a__      )
       lowerCamelCase__				   =      [1 / step for step in arithmetic_progression]
       return sum(a__      )


if __name__ == "__main__":
    import doctest

    doctest.testmod()
    print(sum_of_harmonic_progression(1 / 2, 2, 2))

