#include<fstream>
using namespace std;
int n, i, k, p, u, poz;
long long maxim, minim1, s[50005];
int v[50005];
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int main(){
    fin>> n >> k;
    for(i = 1; i <= n; i++){
        fin>> v[i];
        s[i] = s[i - 1] + v[i];
    }
    maxim = -1000000000000LL;
    minim1 = 0;
    poz = 0;
    for(i = k; i <= n; i++){
        if(s[i] - s[poz] > maxim){
            maxim = s[i] - s[poz];
            p = poz + 1;
            u = i;
        }
        if(s[i - k + 1] < minim1){
            minim1 = s[i - k + 1];
            poz = i - k + 1;
        }
    }
    fout<< p <<" "<< u <<" "<< maxim <<"\n";
    return 0;
}