#include <bits/stdc++.h>

using namespace std;

int N, K;
vector<int> v, part;

int main()
{
    freopen("secv2.in", "r", stdin);
    freopen("secv2.out", "w", stdout);

    scanf("%d%d", &N, &K);
    for(int i = 0; i < N; ++i) {
        int temp;
        scanf("%d", &temp);
        if(v.begin() == v.end())
            part.push_back(temp);
        else
            part.push_back(part.back() + temp);
        v.push_back(temp);
    }

    int sumMax = 0;
    pair<int, int> poz;
    for(int i = 0; i <= N-K; ++i) {
        for(int j = i+K-1; j < N; ++j) {
            int x = part[i-1];
            if(i == 0)
                x = 0;
            if(part[j] - x > sumMax) {
                sumMax = part[j] - x;
                poz.first = i+1;
                poz.second = j+1;
            }
        }
    }

    printf("%d %d %d", poz.first, poz.second, sumMax);
    return 0;
}