#include <bits/stdc++.h>

using namespace std;

int n, m, a[3005];

int main()
{
	cin >> n >> m;
	for (int i = 1; i <= n; i++)
		cin >> a[i];

	int tail = 1, head = m, t = 0, maxn = 1000000;
	for (int i = tail; i <= head; i++)
		t += a[i];
	cout << t << endl;
	while (head <= n)
	{
		t -= a[tail++];
		t += a[++head];
		cout << t << endl;
		maxn = min(t, maxn);
	}
	cout << maxn;
	return 0;
}