Totals of every stretch

Problem

A cashier's system stores the number of orders for n hours. Print the total number of orders for every stretch of k hours in a row, from the first stretch to the last.

Input, output and limits

Input: Line 1: two integers n and k. Line 2: n integers.
Output: One line with n - k + 1 integers separated by spaces.
Constraints: 1 ≤ k ≤ n ≤ 1000
0 ≤ orders ≤ 1000

Examples

Example

Input

5 2
3 1 4 1 5

Output

4 5 5 6

The stretches are 3+1, 1+4, 4+1 and 1+5.

Hints

Try the problem first. Open one hint at a time.

Hint 1

There are n - k + 1 stretches.

Hint 2

Build a list and append the running total after each move.

Write your Python code, run it on the examples and submit it to hidden tests.

Solve in the editor

Best stretch of saleseasy
Good hourseasy
Most vowels in a roweasy
Quietest stretcheasy
Stretches with no repeatseasy

All Python problems

Problem

Input, output and limits

Examples

Hints

More Sliding Window problems

Problem

Input, output and limits

Examples

Hints

More Sliding Window problems