#include <cstdio>
#include <algorithm>

using namespace std;
int i,aux,n,b,k,j,p,s[500010],m,st,start,start_max,end_max,nr;

int main()
{
    freopen ("secv2.in","r",stdin);
    freopen ("secv2.out","w",stdout);

    scanf("%d",&n);
    scanf("%d",&k);
    int min=2000000000,max=-2000000000;
    for(i=1;i<=n;i++)
    {
        scanf("%d",&s[i]);
        s[i]=s[i]+s[i-1];
    }
    for(i=k;i<=n;i++)
    {
       if(s[i-k]<min)
        {
            min=s[i-k];
            start=i-k+1;
        }
        if(s[i]-min>max)
        {
            max=s[i]-min;
            start_max=start;
            end_max=i;
        }
    }
    printf("%d %d %d\n",start_max,end_max,max);

    }



















  /*  for(i=1;i<=n;i++)
    {
        scanf("%d",&nr);
        if(s+nr>=nr)
        {
            s=s+nr;
        }
        else
        {
            s=nr;
            st=i;
        }
        if(smax<s && i-st>k)
        {
            smax=s;
            stmax=st;
            drmax=i;
        }

    }
    printf("%d %d %d",stmax,drmax,smax);


}*/