#include <fstream>
#include <limits.h>
#include <algorithm>
using namespace std;

ifstream cin("secv2.in");
ofstream cout("secv2.out");

const int MAXN = 7000005;



int main(void) {

     long long n, S,i,k;
    unsigned long long bestSum = -ULLONG_MAX;;
    long long sum = 0, beg=1, sf=1, idx=1;
    cin >> n;
    cin>>k;
    for(i=1;i<=n;i++) {
        cin >> S;
        if (sum < 0)
            sum = S, idx = i;
        else
            sum += S;
        if (bestSum < sum&& i-idx>=k)
            bestSum = sum, beg = idx, sf = i;
    }

    cout << beg<<" " << sf<<" "<<bestSum;

    cin.close(), cout.close();
    return 0;
}