

"""simple docstring"""


def 					a__					(					)			->			int:

		for a in range(3_0_0				):
				for b in range(a + 1      ,				4_0_0				):
						for c in range(b + 1      ,				5_0_0				):
								if (a + b + c) == 1_0_0_0 and (a**2) + (b**2) == (c**2):
										return a * b * c

		return -1






def 					a__					(					)			->			int:

		for a in range(3_0_0				):
				for b in range(4_0_0				):
						__lowerCAmelCase: Optional[Any]					   =    1_0_0_0 - a - b
						if a < b < c and (a**2) + (b**2) == (c**2):
								return a * b * c

		return -1






def 					a__					(					)			->			None:
		import timeit

		print(
		    timeit.timeit("solution()"      ,				setup="from __main__ import solution"      ,				number=1_0_0_0				)				)
		print(
		    timeit.timeit(
		        "solution_fast()"      ,				setup="from __main__ import solution_fast"      ,				number=1_0_0_0				)				)


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





"""simple docstring"""


from __future__ import annotations






def 					a__					(					__SCREAMING_SNAKE_CASE      ,				__SCREAMING_SNAKE_CASE      ,				__SCREAMING_SNAKE_CASE				)			->			tuple[float, float]:
		assert (
		    c % greatest_common_divisor(__SCREAMING_SNAKE_CASE      ,				__SCREAMING_SNAKE_CASE				) == 0
		)  # greatest_common_divisor(a,b) function implemented below
		((__lowerCAmelCase)   ,				(__lowerCAmelCase)   ,				(__lowerCAmelCase)): Dict					   =    extended_gcd(__SCREAMING_SNAKE_CASE      ,				__SCREAMING_SNAKE_CASE				)  # extended_gcd(a,b) function implemented below
		__lowerCAmelCase: Optional[int]					   =    c / d
		return (r * x, r * y)






def 					a__					(					__SCREAMING_SNAKE_CASE      ,				__SCREAMING_SNAKE_CASE      ,				__SCREAMING_SNAKE_CASE      ,				__SCREAMING_SNAKE_CASE = 2				)			->			None:
		((__lowerCAmelCase)   ,				(__lowerCAmelCase)): Optional[Any]					   =    diophantine(__SCREAMING_SNAKE_CASE      ,				__SCREAMING_SNAKE_CASE      ,				__SCREAMING_SNAKE_CASE				)  # Initial value
		__lowerCAmelCase: Optional[Any]					   =    greatest_common_divisor(__SCREAMING_SNAKE_CASE      ,				__SCREAMING_SNAKE_CASE				)
		__lowerCAmelCase: Any					   =    a // d
		__lowerCAmelCase: str					   =    b // d

		for i in range(__SCREAMING_SNAKE_CASE				):
				__lowerCAmelCase: Dict					   =    xa + i * q
				__lowerCAmelCase: List[str]					   =    ya - i * p
				print(__SCREAMING_SNAKE_CASE      ,				__SCREAMING_SNAKE_CASE				)






def 					a__					(					__SCREAMING_SNAKE_CASE      ,				__SCREAMING_SNAKE_CASE				)			->			int:
		if a < b:
				__lowerCAmelCase   ,				__lowerCAmelCase: Any					   =    b, a

		while a % b != 0:
				__lowerCAmelCase   ,				__lowerCAmelCase: List[Any]					   =    b, a % b

		return b






def 					a__					(					__SCREAMING_SNAKE_CASE      ,				__SCREAMING_SNAKE_CASE				)			->			tuple[int, int, int]:
		assert a >= 0 and b >= 0

		if b == 0:
				__lowerCAmelCase   ,				__lowerCAmelCase   ,				__lowerCAmelCase: List[str]					   =    a, 1, 0
		else:
				((__lowerCAmelCase)   ,				(__lowerCAmelCase)   ,				(__lowerCAmelCase)): Dict					   =    extended_gcd(__SCREAMING_SNAKE_CASE      ,				a % b				)
				__lowerCAmelCase: Dict					   =    q
				__lowerCAmelCase: int					   =    p - q * (a // b)

		assert a % d == 0 and b % d == 0
		assert d == a * x + b * y

		return (d, x, y)


if __name__ == "__main__":
			from doctest import testmod

			testmod(name="diophantine", verbose=True)
			testmod(name="diophantine_all_soln", verbose=True)
			testmod(name="extended_gcd", verbose=True)
			testmod(name="greatest_common_divisor", verbose=True)


