#include <deque>
#include <fstream>
#include <iostream>


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

long long n,k,s,a,minim=10000001;
int main()
{

    fin>>n>>k;
    deque <int> d ;
    for(int i=1;i<=n;i++)
    {
      fin>>a;
      d.push_back(a);
    }

    while(d.size()>=k)
    {
        for(int i=0;i<k;i++)
        {
            if(d[i]<minim)
            {
                minim=d[i];

            }
        }
        s+=minim;
        minim=1000000;
        d.pop_front();

    }
    fout<<s;


    return 0;
}