#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");

long long s[50002];
int n, k, x, best, mini = 99999999, st, en, start;

void read(){
    fin >> n >> k;
    for(int i = 1; i <= n; i++)
        fin >> x, s[i] = s[i-1]+x;
}

void solve(){
    best = s[k];
    for(int i = k; i <= n; i++){
        if(s[i-k] < mini)
            mini = s[i-k], st = i-k+1;
        if(s[i]-mini > best)
            best = s[i]-mini, start = st, en = i;
    }
    if(start == 0 && en == 0)
        fout << 1 << ' ' << n << best;
    else
        fout << start << ' ' << en << ' ' << best;
}

int main()
{
    read();
    solve();
    
    return 0;
}