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

#define DIM 50005
int v[DIM];

int minim( int a, int b ){
    if( a > b ) return b;
    return a;
}

int main()
{

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

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

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

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

            if( mi > v[i-k-1] ){
                mi = v[i-k-1];
                id = i - k - 1;
            }

            if( v[i] - mi > ma ){
                ma = v[i] - mi;
                begi = id + 1;
                endi = i;
            }
        }

    }

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

    return 0;
}