#include <iostream>
#include <fstream>
#include <algorithm>
#include <cmath>
#define nmax 500005
#define For(i,a,b) for (int i=(a);i<=(b);++i)

using namespace std;
int sum[nmax],suma,start,End,mn=-123344456,Min=0,poz1,poz2,p,n,k;
int main()
{
    ifstream fin("secv2.in");
    ofstream fout("secv2.out");
    fin>>n>>k;
    For(i,1,n)
       fin>>sum[i];
    For(i,1,n)
    {
        sum[i]+=sum[i-1];
        if (sum[i]-Min>mn) mn=sum[i]-Min,poz1=p+1,poz2=i;
        if (i-p>=k) suma=mn,start=poz1,End=poz2;
        if (Min>sum[i]) Min=sum[i];
    }
    if (n==k) fout<<1<<" "<<k<<" "<<sum[n];
    else  fout <<start<<" "<<End<<" "<<suma;
    return 0;
}