#include <fstream>
#include <bitset>
#include <deque>
#include <queue>
#include <algorithm>
// #include <fgm>
#include <vector>

#include <cstdio>

using namespace std;

const int inf = 2e8;


int sum[50001];

int main(){
    freopen ("secv2.in", "r", stdin);
    freopen ("secv2.out", "w", stdout ) ;
    int n, K, i, X, st, dr, maxim, j;
    st = dr = 0, maxim = - inf;
    scanf ("%d%d", &n,&K);
    for (i = 0 ; i < n ; ++i){
        scanf ("%d", &X);
        sum[i] = sum[i-1] + X;

    }
    for (i = 0 ; i < n - K    ; ++i){
            for (j = i + K - 1 ; j < n ; j++){
                    if (sum[j] - sum[i-1] > maxim ){
                            maxim = sum[j] - sum[i-1];
                    st = i + 1 ;
                    dr = j + 1 ;
                    }
            }
    }
    printf ("%d %d %d", st,dr,maxim);
    return 0;
}