#include <iostream>
#include <deque>
#include <fstream>
using namespace std;

ifstream f("deque.in");
ofstream g("deque.out");

int main() {
    int N, K;
    f>>N>>K;

    deque<int> q;
    int sum = 0;

    for (int i = 0; i<N; i++) {
        int x;
        f>> x;
        cout<<x<<" ";
        q.push_front(x);

        if (q.size() >= K) {
            int min_val = q.front();
            for (int j = 0; j < K; j++) {
                min_val = min(min_val, q[j]);
            }
            sum += min_val;
        }
    }


    g<< sum << endl;

    return 0;
}