Ivan runs the observatory at the dune sea of Caravanrest. Today the books show a list of panels, and the numbers must be worked out before sundown. 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 <= 1395; -1000000 <= a[i] <= 1000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= k <= n <= 1395; -1000000 <= a[i] <= 1000.
