#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, k;
  cin >> n >> k;
  vector<long long> a(n);
  for (long long i = 0; i < n; i++) cin >> a[i];
  vector<long long> q(n);
  for (long long i = 0; i < k; i++) q[k - 1] += a[i];
  for (long long i = k; i < n; i++) q[i] = q[i - 1] + a[i] - a[i - k];
  vector<pair<long long, long long>> left(n);
  left[0] = {q[0], 0};
  for (long long i = 1; i < n; i++) {
    if (q[i] > left[i - 1].first)
      left[i] = {q[i], i};
    else
      left[i] = left[i - 1];
  }
  long long ans = 0, l = 0, r = 0;
  for (long long i = 2 * k - 1; i < n; i++) {
    long long first_ans = q[i];
    pair<long long, long long> second_ans = left[i - k];
    if (first_ans + second_ans.first > ans) {
      ans = first_ans + second_ans.first;
      l = second_ans.second;
      r = i;
    }
  }
  l++, l++, r++, r++;
  l -= k, r -= k;
  cout << l << " " << r;
  return 0;
}
