


'''simple docstring'''

def 							__magic_name__(						lowerCamelCase,				lowerCamelCase):
						__lowerCAmelCase							       =				[1]
						for i in range(2,				lowerCamelCase):
												factorials.append(factorials[-1] * i)
						assert 0 <= k < factorials[-1] * n, "k out of bounds"

						__lowerCAmelCase							       =				[]
						__lowerCAmelCase							       =				list(range(lowerCamelCase))

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

						return permutation


if __name__ == "__main__":
	import doctest

	doctest.testmod()





'''simple docstring'''

def 							__magic_name__(						):
						return [
						    a * b * (1_0_0_0 - a - b)
						    for a in range(1,				9_9_9)
						    for b in range(lowerCamelCase,				9_9_9)
						    if (a * a + b * b == (1_0_0_0 - a - b) ** 2)
						][0]


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

