#include <fstream>
#include <deque>

using namespace std;

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

const int N = 5e4;
int a[N + 1];

deque <int> d;

int n, k, mx, i1, i2;

int main()
{
    cin >> n >> k;
    for (int i = 1; i <= n; ++i)
        cin >> a[i], a[i] += a[i - 1];
    for (int i = k; i <= n; ++i)
    {
        while (!d.empty() && a[i] - a[i - k] >= a[i] - a[d.back()])
            d.pop_back();
        d.push_back(i - k);
        if (!d.empty() && mx < a[i] - a[d.front()])
        {
            mx = a[i] - a[d.front()];
            i1 = d.front() + 1;
            i2 = i;
        }
    }
    cout << i1 << ' ' << i2 << ' ' << mx << '\n';
    return 0;
}