#include <cstdio>
using namespace std;
long long n,k,v[5000009],s,minn;
int main()
{
    freopen("deque.in","r",stdin);
    freopen("deque.out","w",stdout);
    scanf("%d %d",&n,&k);
    long long i;
    for (i=1;i<=n;i++)
        scanf("%d\n",&v[i]);
    long long sol[k+1];
    s=0;
    for (i=1;i<=k;i++)
        sol[i]=v[i];
    minn=sol[1];
    long long j;
    j=k;
    do
    {
	minn=sol[1];
        for (i=1;i<=k;i++)
            if(minn>sol[i])
                minn=sol[i];
        s+=minn;
        for (i=1;i<=k;i++)
        {
            sol[i]=sol[i+1];
        }
        j++;
        sol[k]=v[j];
    }
    while(j<=n);
    printf("%d",s);
    return 0;
}