#include<fstream>
#include<algorithm>

using namespace std;

const int N = 100003;
const int inf = 2000000000;
int a[N],n,i,k,rs=-inf,pos,beg,en;
int Min;

int main()
{
    ifstream cin("secv2.in");
    ofstream cout("secv2.out");

    cin >> n >> k;

    for (i=1;i<=n;i++) cin >> a[i], a[i]+=a[i-1];

    //for (i=1;i<=n;i++) cout << a[i] << " "; cout << "\n";

    Min = 1;
    for (i=k;i<=n;i++)
    {
        int p=i-k;
        if (a[p]<Min) Min=a[p], pos=p+1;
        if (a[i]-Min>rs) rs = a[i] - Min, beg = pos, en = i;
    }
    cout << beg << " " << en << " " << rs ;
    return 0;
}