#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <math.h>


#pragma comment(linker, "/STACK:66777216")

using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll n, p, q;
    cin >> n >> p >> q;
    vector<ll> sum(n, 0);
    cin >> sum[0];
    for (int i = 1; i < n; i++) {
        cin >> sum[i];
        sum[i] += sum[i - 1];
    }

    ll l = 0, r = l + 1, ml = 0, mr = n;
    while (l < n - p - q + 1 && r < n) {
        ll op = sum[r];
        if (l != 0) op -= sum[l - 1];
        if (op >= p && r - l - op + 1 >= q) {
            if (r - l < mr - ml) {
                ml = l;
                mr = r;
            }
            l++;
        }
        else r++;
    }
    cout << ml + 1 << ' ' << mr + 1;
    return 0;
}