




def 		__A		(	__lowerCamelCase							,			__lowerCamelCase    )      ->       Optional[Any]:
	a										=							[1]
	for i in range(2							,			__lowerCamelCase    ):
		factorials.append(factorials[-1] * i    )
	assert 0 <= k < factorials[-1] * n, "k out of bounds"

	a										=							[]
	a										=							list(range(__lowerCamelCase    )    )

	# Find permutation
	while factorials:
		a										=							factorials.pop()
		a				, a										=							divmod(__lowerCamelCase							,			__lowerCamelCase    )
		permutation.append(elements[number]    )
		elements.remove(elements[number]    )
	permutation.append(elements[0]    )

	return permutation


if __name__ == "__main__":
		import doctest

		doctest.testmod()







def 		__A		(	__lowerCamelCase							,			__lowerCamelCase    )      ->       str:
	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
                         and integer and be more than 0"""    )
	if not iterations >= 1:
		raise ValueError("""Iterations must be done more than 0 times to play FizzBuzz"""    )

	a										=							""""""
	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()

