#include <bits/stdc++.h>

using namespace std;

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

const int N_MAX = 50005;

int n, k, ans = -2e9, v[N_MAX], l, r;

deque <int> dq_min;

int main() {
    fin >> n >> k;
    for (int i = 1; i <= n; i++) {
        fin >> v[i];
        v[i] += v[i - 1];
    }
    dq_min.push_back(0);
    for (int i = 1; i <= n; i++) {
        if (ans < v[i] - v[dq_min.front()] && i - (dq_min.front() + 1) + 1 >= k) {
            ans = v[i] - v[dq_min.front()];
            l = dq_min.front() + 1;
            r = i;
        }
        while (!dq_min.empty() && v[dq_min.back()] > v[i])
            dq_min.pop_back();
        dq_min.push_back(i);
    }
    fout << l << " " << r << " " << ans << "\n";
    return 0;
}