#include <bits/stdc++.h>

using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
long long dp[500005], maxim = -0x3f3f3f3f, suma, st, fn;
int n, k, x;

void Solve()
{
  f>>n>>k;
  for(int i = 1;i <= n;++i)
  {
    f>>x;
    dp[i] = dp[i - 1] + x;
    if(i >= k && dp[i - k] < suma)
      st = i - k + 1, suma = dp[i - k];
    else if(i >= k && dp[i] - suma > maxim)
      maxim = dp[i] - suma, fn = i;
  } 
  g<<st<<" "<<fn<<" "<<maxim;
}

int main()
{
  Solve();
  return 0;
}