#include <iostream>
#include <fstream>
#include <queue>

using namespace std;

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

deque<int>dq;
int n, k, sp[500008],a, lg=0, max1=-1e9,min1=1e9, st=0, dr=0;

int main()
{
    fin>>n>>k;
    for (int i=1;i<=n;i++)
    {
        fin>>a;
        sp[i]=sp[i-1]+a;
    }

    for (int i=0;i<k;i++)
    {
        if (min1>sp[i])
        {
            min1=sp[i];
            st=i+1;
        }
    }

    for (int i=k;i<=n;i++)
    {
        if (max1<sp[i])
        {
            max1=sp[i];
            dr=i;
        }
    }
    if (dr-k>=k && min1>sp[k])
    {
        min1=sp[k];
        st=k+1;
    }
    fout<<st<<' '<<dr<<' '<<max1-min1;

}