//
//  main.cpp
//  Secv2
//
//  Created by Darius Buhai on 23/10/2018.
//  Copyright © 2018 Darius Buhai. All rights reserved.
//

#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

ifstream fin("secv2.in");
ofstream fout("secv2.out");

int n, k, maxim, x;
vector<int> sum;

void secv2()
{
    fin>>n>>k;
    maxim = k;

    for (int i = 0; i < n; i++){
        fin>>x;
        if(i>0)
            sum.push_back(sum.back()+x);
        else
            sum.push_back(x);
        if(i >= k-1 && sum.back() > sum[maxim])
            maxim = i;
    }
    int poz = maxim - k;
    for (int i = maxim - k - 1; i >= 0; i--)
        if (sum[i] < sum[poz])
            poz = i;
    fout<<poz+2<<' '<<maxim+1<<' '<<sum[maxim]-sum[poz];
}

int main() {
    secv2();
    return 0;
}