from __future__ import annotations





def 							UpperCAmelCase		(       lowercase				,     lowercase				):







				"""simple docstring"""



				if len(lowercase				) < k or k < 0:
								raise ValueError('''Invalid Input'''				)
				__lowercase					     =				__lowercase					     =				sum(array[:k]				)
				for i in range(len(lowercase				) - k				):
								__lowercase					     =				current_sum - array[i] + array[i + k]
								__lowercase					     =				max(lowercase				,     lowercase				)
				return max_sum


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

		testmod()
		__a    :	Union[str, Any]         =    [randint(-1_0_0_0, 1_0_0_0) for i in range(1_0_0)]
		__a    :	Tuple         =    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()