#include <bits/stdc++.h>
#define int long long
using namespace std;

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

const int NMAX = 5 * 1e6 + 2;

int n, k, v[NMAX];
deque<pair<int, int>> dq;

signed main()
{
    fin >> n >> k;
    for(int i = 1; i <= n; i++)
    {
        fin >> v[i];
    }

    int sum = 0;

    for(int i = 1; i <= n; i++)
    {
        while(!dq.empty() && dq.back().first <= i - k)
        {
            dq.pop_back();
        }
        while(!dq.empty() && dq.front().second >= v[i])
        {
            dq.pop_front();
        }
        dq.push_front({i, v[i]});
        if(i >= k)
        {
            sum += dq.back().second;
            cout << dq.back().second << " ";
        }
    }
    fout << sum;
    return 0;
}