#include <bits/stdc++.h>

using namespace std;

deque<pair<int, int>> ursu;

int main()
{


    ifstream fin{"deque.in"};
    ofstream fout{"deque.out"};

    int N, K;

    fin >> N >> K;

    long long S = 0;

    for(int i = 1; i <= N; ++i)
    {
        int x;
        fin >> x;

        while(ursu.empty() == false && ursu.back().first >= x)
            ursu.pop_back();

        ursu.push_back({x, i});

        if(i >= K)
        {
            S += ursu.front().first;

            if(ursu.front().second + K - 1 == i) ursu.pop_front();
        }
    }

    fout << S;
}