#include <climits>
#include <iostream>
#include <fstream>

using namespace std;

ifstream f("secv2.in");
ofstream g("secv2.out");

int v[50001], n, k;

int main()
    {
        int sum=0, bestSum=INT_MIN, beg, endd, idx=1, sum_f, beg_f, end_f;
        f>>n>>k;
        for(int i=1; i<=n; i++)
            f>>v[i];
        for(int i=1; i<=n; i++)
        {
            if(sum<0)
                sum=v[i], idx=i;
            else sum+=v[i];
            if(sum>bestSum)
            {
                bestSum=sum;
                beg=idx;
                endd=i;
                if(endd-beg+1>=k)
                {
                    sum_f=bestSum;
                    beg_f=beg;
                    end_f=endd;
                }
            }
        }
        g<<beg_f<<" "<<end_f<<" "<<sum_f;
        f.close();
        g.close();
        return 0;
    }