#include <iostream>
#include <fstream>

using namespace std;

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

long long n, k, sir[50005];
long long partiale[50005], maxi, ind_start, ind_end, ind_mini;

void solve()
{
    maxi=partiale[k], ind_start=1, ind_end=k;
    int mini=partiale[1];
    for (int i=k+1; i<=n; i++)
    {
        if (partiale[i-k]<mini)
            mini=partiale[i-k], ind_mini=i-k+1;
        if (partiale[i]>maxi)
            maxi=partiale[i], ind_start=1, ind_end=i;
        if (partiale[i]-mini>maxi)
            maxi=partiale[i]-mini, ind_start=ind_mini, ind_end=i;
    }
    g << ind_mini<<' ' <<ind_end <<' '<<maxi;
}

int main() {
    f >> n >> k;
    for (int i=1; i<=n; ++i)
    {
        f >> sir[i];
        partiale[i]=partiale[i-1]+sir[i];
    }
    solve();
    return 0;
}