#include <bits/stdc++.h>

using namespace std;

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

const int NMAX = 5e4;
int v[NMAX+1], sum[NMAX+1];
int dp[NMAX+1][17];
int n, k;

void build(){
    
    for(int i=1; i<=n; i++)
        dp[i][0] = sum[i];
    
    for(int j = 1; (1 << j) <= n; j ++){
        for(int i = 1; i + (1 << j) - 1 <= n; i ++)
            dp[i][j] = max(dp[i][j-1], dp[i + (1 << (j-1))][j-1]);
    }
    
}

int query(int st, int dr){
    
    int stuff = log2(dr - st + 1);
    
    return max(dp[st][stuff], dp[dr - (1 << stuff) + 1][stuff]);
    
}

int main()
{
    f >> n >> k;
    
    for(int i=1; i<=n; i++)
        f >> v[i];
    
    for(int i=1; i<=n; i++)
        sum[i] = sum[i-1] + v[i];
        
    build();
    
    int mx = -2e9;
    int st = -1;
    
    for(int i=1; i + k -1 <= n; i++){
        
        if(mx < query(i+k-1, n) - sum[i-1]){
            
            mx = query(i+k-1, n) - sum[i-1];
            st = i;
            
        }
        
        
    }
    
    int dr = -1;
    for(int i = st + k -1; i<=n; i++)
        if(sum[i] - sum[st-1] == mx)
            dr = i;
            
    g << st << ' ' << dr << ' ' << mx;

    return 0;
}