#include <bits/stdc++.h>

using namespace std;

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

const int nMax = 50010;

int n, k, i, Max=INT_MIN, l, r, p;
int a[nMax];

int main()
{
    fin >> n >> k;
    for(i=1; i<=n; i++)
    {
        fin >> a[i];
        a[i]+=a[i-1];
    }
    for(i=k; i<=n; i++)
    {
        if(a[p]>a[i-k])
            p=i-k;
        if(a[i]-a[p]>Max)
        {
            Max=a[i]-a[p];
            l=p+1;
            r=i;
        }
    }
    fout << l << " " << r << " " << Max;
    return 0;
}