
"""simple docstring"""

def 							A						(    snake_case				:int    , snake_case				:int		)				->     Any:

	if not isinstance(lowerCamelCase_    , lowerCamelCase_		):
		raise ValueError('iterations must be defined as integers'		)
	if not isinstance(lowerCamelCase_    , lowerCamelCase_		) or not number >= 1:
		raise ValueError(
		    'starting number must be\n                         and integer and be more than 0'		)
	if not iterations >= 1:
		raise ValueError('Iterations must be done more than 0 times to play FizzBuzz'		)

	__UpperCamelCase      =	''''''
	while number <= iterations:
		if number % 3 == 0:
			out += "Fizz"
		if number % 5 == 0:
			out += "Buzz"
		if 0 not in (number % 3, number % 5):
			out += str(lowerCamelCase_		)

		# print(out)
		number += 1
		out += " "
	return out


if __name__ == "__main__":
						import doctest

						doctest.testmod()





"""simple docstring"""

from math import factorial

UpperCamelCase     :    List[Any]       =			{str(d): factorial(d) for d in range(1_0)}






def 							A						(    snake_case				:int		)				->     int:
 return sum(DIGIT_FACTORIAL[d] for d in str(snake_case		)		)






def 							A						(    )				->     int:
 __UpperCamelCase      =	7 * factorial(9		) + 1
 return sum(i for i in range(3    , snake_case		) if sum_of_digit_factorial(snake_case		) == i		)


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



