#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int n,k,V[50009];
int main()
{
    int maxim = -1500000000, minim = 1500000000, c1, c2, zm;
    fin >> n >> k;
    for(int i=1; i<=n; i++)
    {
        fin >> V[i];
        V[i] = V[i-1] + V[i];
        if(i >= k)
        {
            if(V[i-k] < minim)
            {
                minim = V[i-k];
                zm = i - k;
            }
            if(V[i] - minim > maxim)
            {
                maxim = V[i] - minim;
                c1 = zm + 1;
                c2 = i;
            }
        }
    }
     
    fout << c1 << ' ' << c2 << ' ' << maxim << '\n';
    fout.close();
    return 0;
}