// Problema secv2
 
#include <stdio.h>
#define MAX       50001
 
int N[MAX];
long S[MAX];
 
int main()
{
    long n, k, i, sum;
    freopen( "secv2.in", "rt", stdin );
	
	scanf( "%ld %ld", &n, &k );

	S[0] = 0;	
	for( i=1; i<=n; i++ ) { 
		scanf( "%d", &N[i] ); 
		S[i] = S[i-1] + N[i];
	}
    fclose( stdin );
     
    long max = -MAX;
    long p, u, j, stop;
	
	p = 0;
	u = 0;
     
    for( i=k-1; i<n; i++ ) {
		stop = i-k+1;
		for( j=0; j<stop; j++ ) {
			if( S[i] - S[j] > max ) {
                max = S[i] - S[j];
				p = j+1;	// Position is index + 1 does not contain current number
                u = i;		
            }
		}
	}
	
    freopen( "secv2.out", "wt", stdout );
        printf( "%ld %ld %ld\n", p, u, max );
    fclose( stdout );
    return 0;
}