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

int main() {
    ifstream fin("deque.in");
    ofstream fout("deque.out");
    
    int n, k;
    deque<pair<int, int>> dq;
    
    fin >> n >> k;
    for (int x, i = 0; i < k; ++i) {
        fin >> x;
        while (!dq.empty() && dq.back().second >= x)
            dq.pop_back();
        
        dq.push_back({i, x});
    }
    
    int sum = dq.front().second;
    for (int x, front = 0, back = k;
            back < n;
            ++front, ++back) {
        fin >> x;
        
        if (dq.front().first == front)
            dq.pop_front();
            
        while (!dq.empty() && dq.back().second >= x)
            dq.pop_back();
            
        dq.push_back({back, x});
        sum += dq.front().second;
    }
    
    fout << sum << endl;
    
    return 0;
}