#include <fstream>
#include <iostream>
#include <deque>
#define MAX 5000000

using namespace std;

deque<int> v, poz;
int main()
{
    int n, k, i, a;
    long long suma = 0;

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

    fin >> n >> k;

    for(i = 1; i <= k; i++)
    {
        fin >> a;

        while(!v.empty() && v.back() >= a)
        {
            v.pop_back();
            poz.pop_back();
        }

        v.push_back(a);
        poz.push_back(i);
    }

    suma += (long long)(v.front());

    for(i = k + 1; i <= n; i++)
    {
        fin >> a;

        if(poz.front() == i - k)
        {
            v.pop_front();
            poz.pop_front();
        }

        while(!v.empty() && v.back() >= a)
        {
            v.pop_back();
            poz.pop_back();
        }

        v.push_back(a);
        poz.push_back(i);

        suma += (long long)(v.front());
    }

    fout << suma;

    fin.close();
    fout.close();

    return 0;
}