#include <iostream>
#include <fstream>
using namespace std;
long long n,k,s[50001],maxx=-1250000000,maxxi,minn=1250000000,minni;
int main()
{
    ifstream f("secv2.in");
    ofstream g("secv2.out");

    f>>n>>k;

    for(int i = 1;i<=n;i++)
    {
        f>>s[i];
        s[i]=s[i-1]+s[i];
    }

    for(int i = k;i<=n;i++)
    {
        if(s[i-k]<minn)
        {
            minn = s[i-k];
            minni = i-k+1;
        }
        if(s[i]-minn > maxx)
        {
            maxx= s[i]-minn;
            maxxi = i;
        }
    }

    g<<minni<<' '<<maxxi<<' '<<maxx;



    f.close();
    g.close();

    return 0;
}