#include <bits/stdc++.h>

using namespace std;

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

deque <pair <int, int>> dq;

int main() {
    int n, k;
    long long sum = 0;
    fin >> n >> k;
    for (int i=1;i<=n;++i) {
        int x;
        fin >> x;
        while (!dq.empty() and i-dq.front().second >= k) dq.pop_front();
        while (!dq.empty() and dq.back().first >= x) dq.pop_back();
        dq.push_back({x, i});
        if (i>=k) {
            sum += dq.front().first;
        }
    }
    fout << sum;
    return 0;
}