



def 					__lowerCAmelCase		(  __lowerCamelCase	:    int = 1000	)  ->						List[str]:
					__lowerCAmelCase	   =3
					__lowerCAmelCase	   =0
					while a < n:
										if a % 3 == 0 or a % 5 == 0:
															result += a
										elif a % 15 == 0:
															result -= a
										a += 1
					return result


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









def 					__lowerCAmelCase		(  )  ->						Tuple:
					__lowerCAmelCase	   =[]
					__lowerCAmelCase	   =1

					while len(__lowerCamelCase	) < 1E6:
										constant.append(str(__lowerCamelCase	)	)
										i += 1

					__lowerCAmelCase	   ="""""".join(__lowerCamelCase	)

					return (
					    int(constant[0]	)
					    * int(constant[9]	)
					    * int(constant[99]	)
					    * int(constant[999]	)
					    * int(constant[9999]	)
					    * int(constant[99999]	)
					    * int(constant[999999]	)
					)


if __name__ == "__main__":
				print(solution())




