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

int main() {
    int x, n, k, tick = 0, i, nMin = INT_MAX;
    long long sum = 0;
    deque<int> deq;

    ifstream in("deque.in");
    in >> n >> k;
    for (i = 1; i <= k; i++) {
        in >> x;
        while (!deq.empty() && x < deq.back()) {
            deq.pop_back();
            if (x < nMin)
                tick--;
        }
        deq.push_back(x);
        tick++;
        nMin = deq.front();
    }
    sum += deq.front();
    while (in >> x) {
        if (tick == k) {
            deq.pop_front();
            tick = 1;
        }
        nMin = deq.front();
        if (x < nMin) {
            tick = 0;
        }
        while (!deq.empty() && x < deq.back()) {
            deq.pop_back();
        }
        deq.push_back(x);
        sum += deq.front();
        tick++;
    }
    in.close();

    ofstream out("deque.out");
    out << sum << '\n';
    out.close();

    return 0;
}