#include <deque>
#include <fstream>
#include <iostream>
#define ll long long
using namespace std;

deque<int> d;
int n,k;
ll s[50005];

int main()
{
    ifstream fin("secv2.in");
    ofstream fout("secv2.out");
    fin>>n>>k;
    int m;
    for(int i=1;i<=n;i++) {
        fin>>m;
        s[i]=s[i-1]+m;
    }
    ll mx=-25000*k;
    int st=1,dr=1;
    for(int i=1;i<=n;i++) {
        d.push_back(i);
        while(!d.empty()&&d.size()>k&&s[d.back()]<=s[d.front()-1])
            d.pop_front();
        if(d.size()>=k&&s[d.back()]-s[d.front()-1]>mx) {
            mx=s[d.back()]-s[d.front()-1];
            st=d.front();
            dr=d.back();
            //cout<<mx<<" ";
        }
    }
    fout<<st<<" "<<dr<<" "<<mx;
    return 0;
}