#include <bits/stdc++.h>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
int N, K;
long long s;
vector<int>v;
deque<int>q;
int main() {
    fin >> N >> K;
    v = vector<int>(N + 4);
    for(int i = 1; i <= N; i++) {
        fin >> v[i];
    }
    for(int i = 1; i <= N; i++) {
        while(!q.empty() && v[q.back()] >= v[i]) {
            q.pop_back();
        }
        q.push_back(i);
        if(i >= K) {
            while(q.front() <= i - K) {
                q.pop_front();
            }
            cout << v[q.front()] << '\n';
            s += v[q.front()];
        }
    }
    fout << s << '\n';
    return 0;
}