#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <algorithm>

#define MAXN 200000

using namespace std;

long long input[MAXN + 2],
          sum[MAXN + 2];

int main() {
    #ifdef mahfuz
    freopen("input", "r", stdin);
    #endif

    int n, k;
    long long r, sum_sofar, l, a, b, maxb;
    cin >> n >> k;

    cin >> input[0];
    sum[0] = input[0];

    for(int i = 1; i < n; i++) {
        cin >> input[i];
        sum[i] = sum[i - 1] + input[i];
    }

    r = sum[n - 1] - sum[n - k - 1];
    sum_sofar = sum[n - 1] - sum[n - 2*k - 1];

    for(int i = n - 2 * k; i >= 0; i--) {
        if(r <= sum[i + 2*k - 1] - sum[i + k - 1]) {
            r = sum[i + 2*k - 1] - sum[i + k - 1];
            maxb = i + k;
        }

        //r = max(r, sum[i + 2*k - 1] - sum[i + k - 1]);
        l = sum[i + k - 1] - sum[i  - 1];

        if(sum_sofar <= l + r) {
            sum_sofar = l + r;
            a = i;
            b = maxb;
        }

        //cout << i << " " << l << " " << r << " " << sum_sofar << endl;
    }

    cout << a + 1 << " " << b + 1 << endl;

    return 0;
}