#include <fstream>
#include <cstring>
#include <algorithm>
#include <deque>
using namespace std;

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

int n, m;
long long sol;
deque<pair<int, int>> s;

int main() {

    fin >> n >> m;

    for (int i = 1; i <= n; ++i) {
        long long k;
        fin >> k;
        while (!s.empty() && k < s.back().first) {
            s.pop_back();
        }
        s.push_back({k, i});
        if (i >= m) {
            while (s.front().second <= i - m) {
                s.pop_front();
            }
            sol += (long long)s.front().first;
        }
    }
    fout << sol;

    fout.close();
    return 0;
}