






from __future__ import annotations







def     a_   (__A				,       __A      )				->						int:



					"""simple docstring"""
					if len(__A      ) < k or k < 0:
										raise ValueError("Invalid Input"      )
					__a					:						str      =					sum(array[:k]      )
					for i in range(len(__A      ) - k      ):
										__a					:						Optional[Any]      =					current_sum - array[i] + array[i + k]
										__a					:						Any      =					max(__A				,       __A      )
					return max_sum


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

			testmod()
			UpperCAmelCase__      			=						[randint(-1000, 1000) for i in range(100)]
			UpperCAmelCase__      			=						randint(0, 110)
			print(F"The maximum sum of {k} consecutive elements is {max_sum_in_array(array,k)}")













def     a_   (__A				,       __A				,       __A				,       __A      )				->						int:



					"""simple docstring"""
					__a      ,			__a					:						Any      =					len(__A      ), len(grid[0]      )
					if (
					    min(__A				,       __A      ) < 0
					    or row == row_length
					    or col == col_length
					    or (row, col) in visit
					    or grid[row][col] == 1
					):
										return 0
					if row == row_length - 1 and col == col_length - 1:
										return 1

					visit.add((row, col)      )

					__a					:						Dict      =					0
					count += depth_first_search(__A				,       row + 1				,       __A				,       __A      )
					count += depth_first_search(__A				,       row - 1				,       __A				,       __A      )
					count += depth_first_search(__A				,       __A				,       col + 1				,       __A      )
					count += depth_first_search(__A				,       __A				,       col - 1				,       __A      )

					visit.remove((row, col)      )
					return count


if __name__ == "__main__":
			import doctest

			doctest.testmod()





