#include <iostream>
#include <fstream>
using namespace std;

ifstream f("secv2.in");
ofstream g("secv2.out");

int main()
{
    int n,k=0,v[50005], bestSum=-int(2e9), contor=0, idx=-1,p,u, vmin=int(2e9);
    f >> n >> k;
    for (int i=1; i<=n; i++)
        f >> v[i];
    for (int i=1; i<=n; i++)
    {
        v[i]+= v[i-1];
        if (bestSum < v[i]- vmin && i-idx>=k && idx!=-1)
        {
            bestSum = v[i] - vmin;
            p=idx+1; u=i;

        }
        if (vmin > v[i])
        {
            vmin = v[i];
            idx=i;
        }
    }
    g << p << " " << u << " " <<bestSum;
    return 0;
}