#include<stdio.h>
#include<algorithm>
int K,N,A[50001],M,MN,S;
using namespace std;
int main()
{
    freopen("secv2.in","r",stdin);
    freopen("secv2.out","w",stdout);
    scanf("%d%d",&N,&K);
    int c;
    MN = M = -1500000000;
    MN = -MN;
    for (int i=1;i<=N;++i)
    {
        scanf("%d",&c);
        A[i]=A[i-1]+c;
    }
    int ui,uj;
    int poz = 0;
    for (int i=K;i<=N;++i)
    {
        MN=min(MN,A[i-K]);
        if (MN == A[i - K]) poz = i - K;
        S=A[i]-MN;
        M=max(M,S);
        if (M==S) {ui=i;uj=poz;}
    }
    printf("%d %d %d",uj + 1,ui,M);
    return 0;
}