#include <iostream>
#include <fstream>
#include <deque>

using namespace std;

ifstream fin("secv2.in");
ofstream fout("secv2.out");

const long long INF = (1<<63);
const int DIM = 50005;

long long S[DIM],ans=INF,sum=-INF;

int n,k,x,in,sf,pos;

int main()
{
    fin>>n>>k;
    for(int i=1;i<=n;i++)
    {
        fin>>x;
        S[i]=S[i-1]+x;
    }
    for(int i=k;i<=n;i++)
    {
        if(S[i-k]<ans)
        {
            ans=S[i-k];
            pos=i-k+1;
        }
        if(S[i]-ans>sum)
        {
            sum=S[i]-ans;
            in=pos;
            sf=i;
        }
    }
    fout<<in<<" "<<sf<<" "<<sum<<'\n';
}