The harbor bell rings at the island market of Coralcove; Xanthe weighs the day's segments manifests and starts the calculations. Task: Print the maximum sum of any contiguous subarray of length exactly k. Input format: First line: n and k. Second line: n integers. Output format: Print the maximum window sum. Constraints: 1 <= k <= n <= 1722; 1 <= a[i] <= 1000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= k <= n <= 1722; 1 <= a[i] <= 1000.
