#include <bits/stdc++.h>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");

long long A[5000001],N,K,st=0,dr=0,i,mn;
unsigned long long S;
int main()
{

    fin>>N>>K;
    dr=st+K-1;
    for(i=0;i<N;i++)
        fin>>A[i];
    while(dr<=i-1)
    {
        mn=A[st];
        for(int j = st;j<=dr;j++)
            if(A[j]<mn)
                mn=A[j];
        fout<<"st e "<<A[st]<<" dr e "<<A[dr];
        fout<<" Minimul e "<<mn<<'\n';
        S=S+mn;
        st++;
        dr++;
    }
    fout<<S;

}