#include <fstream>
#define Inf 0x3f3f3f3f
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
long n,i,a[50001],sum[50001],best[50001],bestSum,min0,j,ii,ji,k;
int main()
{
    f>>n;
    f>>k;
    sum[0]=0;
    for(i=1;i<=n;i++)
    {
        f>>a[i];
        sum[i]=a[i]+sum[i-1];
    }

    min0=sum[0];
    j=1;
    bestSum=sum[k];
    if(n!=1)
    {for(i=1;i<=n;i++)
    {
        best[i]=sum[i]-min0;
        if(min0 > sum[i]) {
        min0=sum[i];
        j=i+1;
        }
        if(bestSum<best[i]&&i-j>=k)
                {
                    ii=i;
                    ji=j;
                    bestSum=best[i];}
    }
    g<<ji<<" "<<ii<<" "<<bestSum;}
    else
    g<<"1"<<" "<<"1"<<" "<<sum[1];

    return 0;
}