#include <fstream>
#include <deque>
using namespace std;

ifstream fin ("secv2.in");
ofstream fout("secv2.out");


const int N = 5e5 + 1;
int a[N], n, k;
int sum_max = -3e5;
int sf = 0;
int l, r;

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

    for (int i = 1; i <= n; ++i)
        fin >> a[i];

    for (int i = 2; i <= n; ++i)
        a[i] += a[i - 1];

    for (int i = 1; i <= n; ++i)
        for(int j = n; j >= i + k - 1; --j)
            if (a[j] - a[i - 1] > sum_max)
                {
                    sum_max = a[j] - a[i - 1];
                    l = i;
                    r = j;
                }

    fout << l << " " << r  << " " << sum_max;

    

    

    
    
    
}