The council of the lantern district of Glowfen pays by the answer, and Tanner intends to earn it. First: the full register of segments. Task: Print the minimum sum of any contiguous subarray of length exactly k. Input format: First line: n and k. Second line: n integers. Output format: Print the minimum window sum. Constraints: 1 <= k <= n <= 2001; -1000000 <= a[i] <= 1000000000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= k <= n <= 2001; -1000000 <= a[i] <= 1000000000.
