#include <iostream>

using namespace std;

const int nMax = 5000005;

int v[nMax], dq[nMax], front = 1, back, n, k;
long long sum;

int main() {
    freopen("deque.in", "r", stdin);
    freopen("deque.out", "w", stdout);

    cin >> n >> k;
    for (int i = 0; i < n; i++) {
        cin >> v[i];

        while (front <= back and v[dq[back]] >= v[i]) back--;

        dq[++back] = i;
        if (i >= k-1) {
            sum += v[dq[front]];
        }

        if (i - dq[front] + 1 >= k) front++;
    }

    cout << sum;
    return 0;
}