#include<cstdio>
#include<algorithm>
using namespace std;
int n,k,m[50005],s[50005],x,maxim,ld,c[50005],ls,l1,l2;
int main()
{
    freopen("secv2.in","r",stdin);
    freopen("secv2.out","w",stdout);
    scanf("%d%d",&n,&k);
    m[0]=0;
    c[0]=0;
    s[0]=0;
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&x);
        s[i]=s[i-1]+x;
        if (x<m[i-1])
        {
            c[i]=i;
            m[i]=x;
        }
            else
            {c[i]=c[i-1];m[i]=m[i-1];}
    }
    maxim=s[k];
    ls=1;
    ld=k;
    for(int i=(k+1);i<=n;i++)
    {
        x=s[i]-m[i-k];
        l1=c[i-k]+1;
        l2=i;
        if (x>maxim)
        {
            maxim=x;
            ld=i;
            ls=c[i-k]+1;
        }
            else
        if (x==maxim && (l2-l1)>(ld-ls))
        {
            ld=i;
            ls=c[i-k]+1;
        }
    }
    printf("%d %d %d\n",ls,ld,maxim);
    return 0;
}