#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int n,k,i,possf,posin,sum,v[50001],s_part[50001];
int main()
{
    fin>>n>>k;
    for(i=1;i<=n;i++)
    {
        fin>>v[i];
        sum+=v[i];
        s_part[i]=sum;
    }
    possf=std::distance(s_part,max_element(s_part+1,s_part+1+n));
    posin=std::distance(s_part,min_element(s_part+1,s_part+1+possf-k+1));
    fout<<posin+1<<' '<<possf<<' '<<s_part[possf]-s_part[posin];
    return 0;
}