#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int n,k,vCit[50005];
vector <pair<int,int> > sol;
void citire()
{
    scanf("%d %d",&n,&k);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&vCit[i]);
        vCit[i]+=vCit[i-1];
        sol.push_back(make_pair(vCit[i],i));
    }
}
int main()
{
    freopen("secv2.in","r",stdin);
    freopen("secv2.out","w",stdout);
    citire();
    int st=0,dr=n-1;
    sort(sol.begin(),sol.end());
    while(sol[dr].second-sol[st].second<k)
    {
        if(sol[dr-1].first-sol[st].first>sol[dr].first-sol[st+1].first)
            dr--;
        else
            st++;
    }
    printf("%d %d %d",sol[st].second+1,sol[dr].second,sol[dr].first-sol[st].first);

    return 0;
}