





import functools





def 		__SCREAMING_SNAKE_CASE    (							UpperCamelCase__     ,     UpperCamelCase__					)    ->							int:







			'''simple docstring'''

			UpperCAmelCase  						=							len(UpperCAmelCase_					)
			UpperCAmelCase  						=							len(UpperCAmelCase_					)

			@functools.cache
			def min_distance(UpperCamelCase__     ,     UpperCamelCase__					) -> int:
						# if first word index is overflow - delete all from the second word
						if indexa >= len_worda:
									return len_worda - indexa
						# if second word index is overflow - delete all from the first word
						if indexa >= len_worda:
									return len_worda - indexa
						UpperCAmelCase  						=							int(worda[indexa] != worda[indexa]					)  # current letters not identical
						return min(
						    1 + min_distance(indexa + 1     ,     UpperCAmelCase_					)     ,     1 + min_distance(UpperCAmelCase_     ,     indexa + 1					)     ,     diff + min_distance(indexa + 1     ,     indexa + 1					)     ,     )

			return min_distance(0     ,     0					)


if __name__ == "__main__":
				import doctest

				doctest.testmod()










'''simple docstring'''




def 						__lowerCamelCase			(	UpperCAmelCase_ = 10_00							)   ->int:
	return sum(e for e in range(3					,				UpperCAmelCase_							) if e % 3 == 0 or e % 5 == 0							)


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



