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

using namespace std;

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

const int INF = 2000000000;
const int DIM = 50005;

int n,k,x,DP[DIM],pos,stx,sty,Max=-INF;

int main()
{
    fin>>n>>k;
    for(int i=1;i<=n;i++)
    {
        fin>>x;
        DP[i]=DP[i-1]+x;
    }
    for(int i=k;i<=n;i++)
    {
        int ans=INF;
        for(int j=1;j<=i-k;j++)
        {
            if(DP[j]<ans)
            {
                ans=DP[j];
                pos=j;
            }
        }
        int sum=DP[i]-ans;
        if(sum>Max)
        {
            Max=sum;
            stx=pos+1;
            sty=i;
        }
    }
    fout<<stx<<" "<<sty<<" "<<Max<<'\n';
}