#include <fstream>
#include <iostream>
#define maxn 50001
#define INF 0x3f3f3f3f
using namespace std;

int n, k, s[maxn];
int best[maxn], maxim = -INF, beg, endn;
int deq[maxn], st = 1, dr;

ifstream f("secv2.in");
ofstream g("secv2.out");

int main(){
    f >> n >> k;
    for(int i=1; i<=n; ++i) f >> s[i], s[i]+=s[i-1];

    for(int i=1; i<=n; ++i){
        for(int j=0; j<=i-k; ++j){
            if(s[i] - s[j] > maxim){
                maxim = s[i] - s[j];
                beg = j + 1;
                endn = i;
            }
        }

    }
    g << beg << ' ' << endn << ' ' << maxim;
}