





def      __snake_case						(					_lowerCAmelCase : int = 1000	) ->						int:
   A_					:				List[str]          =			0
   for i in range(_lowerCAmelCase	):
      if i % 3 == 0 or i % 5 == 0:
         result += i
   return result


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







def      __snake_case						(					_lowerCAmelCase : float				,				_lowerCAmelCase : float				,				_lowerCAmelCase : int	) ->						float:
   A_					:				List[str]          =			[1 / first_term]
   A_					:				Tuple          =			1 / first_term
   for _ in range(number_of_terms - 1	):
      first_term += common_difference
      arithmetic_progression.append(_lowerCAmelCase	)
   A_					:				List[str]          =			[1 / step for step in arithmetic_progression]
   return sum(_lowerCAmelCase	)


if __name__ == "__main__":
 import doctest

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