#include <fstream>
#include <iostream>
#include <vector>

using namespace std;

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

int main()
{
    int n,m,i, minn,x;
    vector <int> a;
    fin>>n>>m;
    for(i=0;i<n;i++)
    {
        fin>>x;
        a.push_back(x);
    }
    int st = 0, dr = m-1;
    minn  = a[st];
    for (i = st+1; i<= dr ; i++)
    {
        if(minn>a[i])
            minn = a[i];
    }
    cout<<minn;
    long long sum =0;
    sum += minn;
    st++;
    dr++;
    while(dr<n)
    {
        if(a[dr]< minn)
        {
            minn = a[dr];
        }
        else
        {
            if(a[st-1] == minn)
            {
                minn = a[st];
                for(i = st+1;i<=dr;i++)
                    if( a[i]<minn)
                        minn = a[i];
            }
        }
        sum += minn;
        st++;
        dr++;
        cout<<minn;

    }
    fout<<sum;


    return 0;
}