





from __future__ import annotations







def       UpperCAmelCase							(     _lowerCamelCase      :  list[int]			,   _lowerCamelCase      :  int     ):





						'''simple docstring'''


						if len(_lowerCamelCase     ) < k or k < 0:
												raise ValueError("Invalid Input"     )
						SCREAMING_SNAKE_CASE__     :				int   =					sum(array[:k]     )
						for i in range(len(_lowerCamelCase     ) - k     ):
												SCREAMING_SNAKE_CASE__     :				str   =					current_sum - array[i] + array[i + k]
												SCREAMING_SNAKE_CASE__     :				Union[str, Any]   =					max(_lowerCamelCase			,   _lowerCamelCase     )
						return max_sum


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

				testmod()
				__lowercase       :List[str]       =  [randint(-1_000, 1_000) for i in range(100)]
				__lowercase       :Any       =  randint(0, 110)
				print(f"The maximum sum of {k} consecutive elements is {max_sum_in_array(array,k)}")






def       UpperCAmelCase							(     _lowerCamelCase      :  int = 1_000     ):





						'''simple docstring'''


						SCREAMING_SNAKE_CASE__     :				Dict   =					-1
						SCREAMING_SNAKE_CASE__     :				str   =					0
						for a in range(1			,   n // 3     ):
												# Solving the two equations a**2+b**2=c**2 and a+b+c=N eliminating c
												SCREAMING_SNAKE_CASE__     :				Tuple   =					(n * n - 2 * a * n) // (2 * n - 2 * a)
												SCREAMING_SNAKE_CASE__     :				Dict   =					n - a - b
												if c * c == (a * a + b * b):
																		SCREAMING_SNAKE_CASE__     :				str   =					a * b * c
																		if candidate >= product:
																								SCREAMING_SNAKE_CASE__     :				List[str]   =					candidate
						return product


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