#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n, k, a[50001], dp[50001], s[50001];
int main()
{
    f >> n >> k;
    for (int i = 1; i <= n; ++i) {
        f >> a[i];
        s[i] = s[i - 1] + a[i];
    }
    int imax = 1, jmax = k, mini = 1;
    for (int i = 1; i <= k; ++i) dp[i] = dp[i - 1] + a[i];
    for (int i = k + 1; i <= n; ++i) {
        if (s[i - k] < s[mini]) mini = i - k;
        if (s[i] - s[mini] > dp[i - 1]) {
            dp[i] = s[i] - s[mini];
            imax = mini + 1;
            jmax = i;
        }
        else dp[i] = dp[i - 1];
    }
    g << imax << ' ' << jmax << ' ' << dp[n] << endl;
    return 0;
}