Battleship
Parallel to the coastline, an enemy fleet is stationed at sea. The area where the fleet is located is divided into n squares. On the main ship of our fleet, there is a secret weapon capable of striking k consecutive squares simultaneously. All enemy ships within these targeted squares will be destroyed. Unfortunately, the secret weapon can only be used once, so it's crucial to maximize the damage inflicted on the enemy with this single shot.
Write a program to determine the maximum number of ships that can be destroyed with one shot.
Input
The first line contains two integers n and k (1 ≤ k ≤ n ≤ 10^5). The second line contains n integers a_{i} (0 ≤ a_i ≤ 10000), where each integer represents the number of ships in the corresponding square of the strip.
Output
Output the maximum number of ships that can be destroyed.