It is audit day at the anvil district of Hammerfall. Nils spreads the ribbons records across the table and picks up a sharp pencil. 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 <= 1253; -1000000 <= a[i] <= 1000.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= k <= n <= 1253; -1000000 <= a[i] <= 1000.
