#include <cstdio>
#include <deque>
using namespace std;

#define DIM 50005
int v[DIM];
int d[DIM];

deque < int  > Q;

int main()
{

    freopen("secv2.in","r",stdin);
    freopen("secv2.out","w",stdout);

    int n, i, j, s, t, k, id,  ma, begi, endi;
    ma = -(1<<29);

    scanf("%d%d",&n,&k);

    scanf("%d",&v[1]);
    d[1] = v[1];
    Q.push_back(1);

    for( i = 2; i <= n; ++i ){
        scanf("%d",&v[i]);
        v[i] += v[i-1];

        d[i] = v[i] - v[Q.front()];
        id = Q.front() + 1;

        while( !Q.empty() && v[Q.back()] > v[i] )
            Q.pop_back();

        Q.push_back(i);

        if( i - id + 1 > k && d[i] > ma ){
            ma = d[i];
            begi = id;
            endi = i;
        }
    }

    printf("%d %d %d",begi,endi,ma);

    return 0;
}