/* Problem URL: https://codeforces.com/edu/course/2/lesson/6/4/practice/contest/285069/problem/A */

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template <class T, class comp = less<>>
using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;

#define V vector

#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)

#define rep(i, lim) for (int i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (int i = s; i < (lim); i++)

#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;

using ll = long long;

using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;

template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
    os << vec[0];
    for (size_t i = 1; i < vec.size(); i++) {
        os << ' ' << vec[i];
    }
    os << '\n';
    return os;
}

template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
    for (auto &i : vec) {
        is >> i;
    }
    return is;
}

template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
    for (auto &i : vec) {
        os << i[0];
        for (size_t j = 1; j < i.size(); j++) {
            os << ' ' << i[j];
        }
        os << '\n';
    }
    return os;
}

template<class v>
auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
    for (auto &i : vec) {
        for (auto &j : i) {
            is >> j;
        }
    }
    return is;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, d;
    cin >> n >> d;

    vl fds(n);
    cin >> fds;

    V<long double> pref(n + 1);

    int lans = 1;
    int rans = 1;
    long double low = 0;
    long double high = 1e7;
    long double eps = 1e-9;

    while ((high - low) >= eps) {
        long double mid = (low + high) / 2;

        rep(i, d - 1) {
            pref[i + 1] = pref[i] + fds[i] - mid;
        }

        int tmpl = 0;
        int tmpr = 0;
        bool pos = false;

        long double minimal = 0;
        int ind = 0;
        
        nrep(i, d, n + 1) {
            pref[i] = pref[i - 1] + fds[i - 1] - mid;

            if (pref[i - d] <= minimal) {
                minimal = pref[i - d];
                ind = i - d;
            }

            if (pref[i] - minimal < 0) {
                continue;
            }

            pos = true;
            tmpl = ind + 1;
            tmpr = i;
            break;
        }

        if (pos) {
            lans = tmpl;
            rans = tmpr;

            low = mid;
            continue;
        }
        
        high = mid;
    }

    cout << lans << ' ' << rans << '\n';
}