#include <fstream>

using namespace std;
int sums[50005], lengths[50005],nr,i,n,k;
ifstream fin("secv2.in");
ofstream fout("secv2.out");

int main()
{
    fin>>n>>k;

    //int sums[n+1], lengths[n+1],nr,i,n;

    fin>>nr;
    sums[1]=nr; lengths[1]=1;
    for(i=2;i<=n;i++)
    {
        fin>>nr;
        if(nr+sums[i-1]>nr)
        {
            sums[i]=sums[i-1]+nr;
            lengths[i]=lengths[i-1]+1;
        }
        else
        {
            sums[i]=nr;
            lengths[i]=1;
        }

    }
    //for(i=1;i<=n;i++)
    //    fout<<sums[i]<<' ';

   // fout<<'\n';
   // for(i=1;i<=n;i++)
   //     fout<<lengths[i]<<' ';

    int maximum_sum=-25000*25000, maximum_sum_right=0;
    for(i=1;i<=n;i++)
        if (maximum_sum<sums[i] && lengths[i]>=k)
        {
            maximum_sum=sums[i];
            maximum_sum_right=i;
        }

    fout<<maximum_sum_right-lengths[maximum_sum_right]+1<<" "<< maximum_sum_right<<" "<< maximum_sum;
    return 0;
}