"""simple docstring"""







from math import factorial

SCREAMING_SNAKE_CASE									=						{str(d): factorial(d) for d in range(10)}


def      __lowerCAmelCase(		__UpperCAmelCase			):






	"""simple docstring"""





	return sum(DIGIT_FACTORIAL[d] for d in str(__UpperCAmelCase			)			)


def      __lowerCAmelCase(		):






	"""simple docstring"""





	_lowercase :    Optional[int]							=							7 * factorial(9			) + 1
	return sum(i for i in range(3     ,__UpperCAmelCase			) if sum_of_digit_factorial(__UpperCAmelCase			) == i			)


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




"""simple docstring"""







import functools


def      __lowerCAmelCase(		__UpperCAmelCase     ,__UpperCAmelCase			):






	"""simple docstring"""





	if not isinstance(__UpperCAmelCase     ,__UpperCAmelCase			) or not all(isinstance(__UpperCAmelCase     ,__UpperCAmelCase			) for day in days			):
		raise ValueError('The parameter days should be a list of integers'			)

	if len(__UpperCAmelCase			) != 3 or not all(isinstance(__UpperCAmelCase     ,__UpperCAmelCase			) for cost in costs			):
		raise ValueError('The parameter costs should be a list of three integers'			)

	if len(__UpperCAmelCase			) == 0:
		return 0

	if min(__UpperCAmelCase			) <= 0:
		raise ValueError('All days elements should be greater than 0'			)

	if max(__UpperCAmelCase			) >= 366:
		raise ValueError('All days elements should be less than 366'			)

	_lowercase :    List[Any]							=							set(__UpperCAmelCase			)

	@functools.cache
	def dynamic_programming(__UpperCAmelCase			) -> int:
		if index > 365:
			return 0

		if index not in days_set:
			return dynamic_programming(index + 1			)

		return min(
		    costs[0] + dynamic_programming(index + 1			)     ,costs[1] + dynamic_programming(index + 7			)     ,costs[2] + dynamic_programming(index + 30			)     ,)

	return dynamic_programming(1			)


if __name__ == "__main__":
						import doctest

						doctest.testmod()



