#include <iostream>
#include <vector>
#include <deque>
#include <fstream>
using namespace std;
ifstream in("deque.in");
ofstream out("deque.out");

int main()
{
    int n, k;
    int64_t sum = 0;
    in>> n >> k;

    vector<int> v(n);
    deque<int> dQ;

    in>> v[0];
    dQ.push_front(v[0]);

    if (k == 1)
    {
        sum += dQ.front();
        dQ.pop_front();
    }

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

        if (dQ.empty() || v[i] >= dQ.front())
            dQ.push_front(v[i]);
        else
        {
            while (not dQ.empty() && v[i] < dQ.front())
            {
                dQ.pop_front();
            }
            dQ.push_front(v[i]);
        }

        if (i >= k - 1)
        {
            sum += dQ.back();
            if (v[i- k + 1] == dQ.back())
                dQ.pop_back();
        }
    }
    out<< sum;


    in.close();
    out.close();
    return 0;
}