#include <bits/stdc++.h>

using namespace std;

ifstream fin("deque.in");
ofstream fout("deque.out");
int n, k, i, a[5000002];
long long r;
deque<int> q;

int main() {
    fin >> n >> k;
    for(i = 1; i <= n; i++) {
        fin >> a[i];
        while(!q.empty() && a[q.back()] >= a[i]) q.pop_back();
        q.push_back(i);

        if(i < k) continue;

        if(!q.empty() && i - q.front() >= k) q.pop_front();
        r += a[q.front()];
    }
    fout << r;

    return 0;
}