



"""simple docstring"""






from __future__ import annotations






def   snake_case__     (	__lowerCamelCase       :					list[int]							,	__lowerCamelCase       :					int			):
			"""simple docstring"""
			if len(__lowerCamelCase			) < k or k < 0:
						raise ValueError('''Invalid Input'''			)
			lowerCamelCase__	:	Dict				=sum(array[:k]			)
			for i in range(len(__lowerCamelCase			) - k			):
						lowerCamelCase__	:	str				=current_sum - array[i] + array[i + k]
						lowerCamelCase__	:	Optional[int]				=max(__lowerCamelCase							,	__lowerCamelCase			)
			return max_sum


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

		testmod()
		_lowercase				:				Dict   		=		[randint(-1_0_0_0, 1_0_0_0) for i in range(1_0_0)]
		_lowercase				:				Dict   		=		randint(0, 1_1_0)
		print(f'The maximum sum of {k} consecutive elements is {max_sum_in_array(array,k)}')









"""simple docstring"""






def   snake_case__     (	__lowerCamelCase       :					int = 10							,	__lowerCamelCase       :					int = 22			):
			"""simple docstring"""
			lowerCamelCase__	:	Optional[Any]				=range(1							,	__lowerCamelCase			)
			lowerCamelCase__	:	str				=range(1							,	__lowerCamelCase			)
			return sum(
			    1 for power in powers for base in bases if len(str(base**power			)			) == power			)


if __name__ == "__main__":
		print(f'{solution(1_0, 2_2) = }')




