
"""simple docstring"""







from __future__ import annotations
def    __lowerCAmelCase    (_UpperCamelCase	,  _UpperCamelCase		):
	if len(_UpperCamelCase		) < k or k < 0:
		raise ValueError('Invalid Input'		)
	__lowerCAmelCase      :						Tuple						      =				sum(array[:k]		)
	for i in range(len(_UpperCamelCase		) - k		):
		__lowerCAmelCase      :						List[Any]						      =				current_sum - array[i] + array[i + k]
		__lowerCAmelCase      :						str						      =				max(_UpperCamelCase	,  _UpperCamelCase		)
	return max_sum


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

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

"""simple docstring"""







import warnings
from functools import wraps
from typing import Callable
def    __lowerCAmelCase    (_UpperCamelCase		):

	@wraps(_UpperCamelCase		)
	def _inner_fn(*_UpperCamelCase	,  **_UpperCamelCase		):
		warnings.warn(
		    (F"'{fn.__name__}' is experimental and might be subject to breaking changes in the future.")	,  _UpperCamelCase	,  )
		return fn(*_UpperCamelCase	,  **_UpperCamelCase		)

	return _inner_fn