#include <bits/stdc++.h>

using namespace std;

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

const int N_MAX = 5e4 + 5;

deque<int>dq;
int ans = -1e9 , s[N_MAX] , n , k , l , r;

int main(){
    ios_base::sync_with_stdio(false);
    fin.tie(NULL);
    fin >> n >> k;
    for (int i=1; i<=n; i++){
        int x; fin >> x;
        s[i] = s[i - 1] + x;
    }
    for (int i=k; i<=n; i++){
        while (dq.empty() == false && s[dq.front()] >= s[i - k]){
            dq.pop_front();
        }
        dq.push_front(i - k);
        if (s[i] - s[dq.back()] > ans){
            ans = s[i] - s[dq.back()];
            l = dq.back() , r = i;
        }
    }
    fout << l + 1 << " " << r << " " << ans;
}