#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");

long long bestsum=-1000000000000000, x;
long start, final, s, n, aux=1, k, nr=0, sum[50005];

int main()
{
    f>>n>>k;
    for (int i=1; i<=n; i++) f>>x, sum[i]=sum[i-1]+x;

    for (int i=1; i<=n; i++)
    {
        if (sum[i]<s) s=sum[i], start=i;

        if (sum[i]-s<bestsum && i-start>=k)
        {
            bestsum=sum[i]-s; final=i;
        }
    }
    g<<start<<" "<<final<<' '<<bestsum<<'\n';
    f.close(); g.close();
    return 0;
}