#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");

long long bestsum=-1000000000000000, sum=0;
long start, final, s, n, aux=1, k, nr=0;

int main()
{
    f>>n>>k;
    if (k==1)
    {
        for (int i=1; i<=n; i++)
        {
            f>>s;
            bestsum=max(bestsum, (long long)s); start=final=i;
        }
        g<<start<<" "<<final<<' '<<bestsum<<'\n';
    }

    else for (int i=1; i<=n; i++)
    {
        f>>s;
        if (sum<0 && n-i>=k && nr>=k) sum=s, aux=i, nr=1;
          else sum+=s, ++nr;

        if (bestsum<sum && nr>=k)
        {
            bestsum=sum; start=aux; final=i;
        }
    }
    g<<start<<" "<<final<<' '<<bestsum<<'\n';
    f.close(); g.close();
    return 0;
}