#include <bits/stdc++.h>

using namespace std;

ifstream fin("deque.in");
ofstream fout("deque.out");

deque<pair<long,long>>q;
long long n,l,sum,x;

int main(){
fin >> n;
fin >> l;
for(int i = 1; i <= n; ++i){
	fin >> x;
	while(q.empty() == false && q.back().first >= x)
		q.pop_back();
	q.push_back({x,i});
	if(i >= l){
		sum += q.front().first;
		cout << sum << '\n';
	} 
	if(i >= q.front().second + l - 1){
		q.pop_front();
	}
}
fout << sum;
}