#include <fstream>
using namespace std;

const int MAX_N = 50000;
int sp[MAX_N + 1];

int main() {
  ifstream fin("secv2.in");
  ofstream fout("secv2.out");
  int N, K;
  fin >> N >> K;
  for (int i = 1; i <= N; ++i) {
    fin >> sp[i];
    sp[i] += sp[i - 1];
  }
  int sol_st = 0, sol_dr = K - 1, min_st = 0;
  for (int i = K; i <= N; ++i) {
    if (sp[i - K] < sp[min_st]) {
      min_st = i - K;
    }
    if (sp[i] - sp[min_st] > sp[sol_dr] - sp[sol_st]) {
      sol_st = min_st;
      sol_dr = i;
    }
  }
  fout << sol_st + 1 << ' ' << sol_dr << ' ' << sp[sol_dr] - sp[sol_st];
}