#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <limits.h>
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;
    }

    pair<int,int> minn = {INT_MAX, 1}, posMaxim = {0,0};
    int maxim = INT_MIN;


    for(int i = 1; i <= n-k; ++i){

        if(minn.first > v[i]){
            minn.first = v[i];
            minn.second = i;
        }

        if(v[i+k] - v[minn.second] > maxim){

            maxim = v[i+k] - v[minn.second] ;

            posMaxim.first = i+k;
            posMaxim.second = minn.second;
        }


    }
    fout << posMaxim.second + 1<< " " << posMaxim.first << " " << maxim << '\n';

    return 0;
}