#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;

int n, k, nr, v[50005];

int main(){
    //ifstream fin("date.in");
    ifstream fin("secv2.in");
    ofstream fout("secv2.out");
    fin >> n >> k;


    for(int i = 1; i <= n; ++i){
        fin >> nr;
        v[i] += v[i-1] + nr;
    }

    int maxim = v[1], lg = 0, maximStart = 1, maximStop = 1;
    for(int i = 2; i <= n; ++i){
        //cout << v[i] << " " << v[i-1] << '\n';
        if(v[i] > v[i-1]){
            ++lg;

       //  cout << v[i] - v[i-lg-1] << "\n";

            if(v[i] - v[i-lg - 1] > maxim && lg >= k){
                maxim = v[i] - v[i-lg - 1];
                maximStart = i;
                maximStop = i-lg;
            }

        }
    }

    fout << maximStop << " " << maximStart << " " << maxim << '\n';

    return 0;
}