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

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

int main()
{
    ios_base::sync_with_stdio(0);
    in.tie(0);

    int n, k;
    in >> n >> k;

    long long sum = 0LL;
    deque<int> dq;

    for(int i = 0; i < n; i++)
    {
        int tmp;
        in >> tmp;

        dq.push_back(tmp);

        if(dq.size() == k)
        {
            sum += min_element(dq.begin(),dq.end());
            dq.pop_front();
        }
    }

    out << sum;

    return 0;
}