#include <iostream>
#include <fstream>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
const int maxn = 50005;
int d[maxn];
int p[maxn];
int v[maxn];
int main()
{
    int n, k;
    in >> n >> k;
    for(int i = 1; i <= n; i++)
        in >> v[i];
    for(int i = 1; i <= n; i++)
        p[i] = p[i-1] + v[i];
    int mn = (1 << 30);
    for(int i = k; i <= n; i++)
    {
        mn = min(mn, p[i-k]);
        d[i] = max(d[i-1], p[i] - mn);
    }
    int mx = 0;
    for(int i = 1; i <= n; i++)
        mx = max(mx, d[i]);
    int dr = 0;
    for(int i = 1; i <= n; i++)
    {
        if(d[i] == mx)
        {
            dr = i;
            break;
        }
    }
    int sum = 0;
    int st = dr;
    while(sum != mx || dr - st + 1 < k)
    {
        sum += v[st];
        st--;
    }
    out << st + 1 << " " << dr << " " << mx << "\n";
    return 0;
}