



from __future__ import annotations


def    __lowerCamelCase   (  lowerCamelCase__	,					lowerCamelCase__		):

				"""simple docstring"""


				if len(lowerCamelCase__		) < k or k < 0:
								raise ValueError("Invalid Input"		)
				lowercase__	:       Optional[Any]						=	sum(array[:k]		)
				for i in range(len(lowerCamelCase__		) - k		):
								lowercase__	:       Dict						=	current_sum - array[i] + array[i + k]
								lowercase__	:       Tuple						=	max(lowerCamelCase__	,					lowerCamelCase__		)
				return max_sum


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

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





def 							UpperCAmelCase		(       lowercase				,     lowercase				):







				"""simple docstring"""



				__lowercase					     =				len(lowercase				)
				__lowercase					     =				len(lowercase				)
				__lowercase					     =				[[False for _ in range(m + 1				)] for _ in range(n + 1				)]
				__lowercase					     =				True
				for i in range(lowercase				):
								for j in range(m + 1				):
												if dp[i][j]:
																if j < m and a[i].upper() == b[j]:
																				__lowercase					     =				True
																if a[i].islower():
																				__lowercase					     =				True
				return dp[n][m]


if __name__ == "__main__":
		import doctest

		doctest.testmod()