



'''simple docstring'''



from __future__ import annotations
def        UpperCAmelCase (    A	:					list[int]       ,		A	:					int					):
							if len(A					) < k or k < 0:
														raise ValueError('''Invalid Input'''					)
							SCREAMING_SNAKE_CASE       :   Dict         =      sum(array[:k]					)
							for i in range(len(A					) - k					):
														SCREAMING_SNAKE_CASE       :   Optional[Any]         =      current_sum - array[i] + array[i + k]
														SCREAMING_SNAKE_CASE       :   Union[str, Any]         =      max(A       ,		A					)
							return max_sum


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

							testmod()
							lowerCAmelCase_  :							Optional[int]             =    [randint(-1000, 1000) for i in range(100)]
							lowerCAmelCase_  :							Optional[int]             =    randint(0, 110)
							print(f'The maximum sum of {k} consecutive elements is {max_sum_in_array(array,k)}')









'''simple docstring'''



def        UpperCAmelCase (    A	:					int       ,		A	:					int					):
							return x if y == 0 else greatest_common_divisor(A       ,		x % y					)
def        UpperCAmelCase (    A	:					int       ,		A	:					int					):
							return (x * y) // greatest_common_divisor(A       ,		A					)
def        UpperCAmelCase (    A	:					int = 20					):
							SCREAMING_SNAKE_CASE       :   Tuple         =      1
							for i in range(1       ,		n + 1					):
														SCREAMING_SNAKE_CASE       :   Optional[int]         =      lcm(A       ,		A					)
							return g


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




