#include <fstream>
#include <deque>

using namespace std;

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

const int DIM = 5000010;

int n, k;
int v[DIM];
deque<int> dq;

int main() {
    fin >> n >> k;
    for (int i = 1; i <= n; i++)
        fin >> v[i];

    long long sum = 0;
    for (int i = 1; i <= n; i++) {
        while (!dq.empty() && v[i] < v[dq.back()])
            dq.pop_back();
        dq.push_back(i);

        if (i - dq.front() == k)
            dq.pop_front();
        if (i >= k)
            sum += v[dq.front()];
    }

    fout << sum;

    return 0;
}