#include <bits/stdc++.h>
using namespace std;
bool is_good(multiset<long long> st, long long l, long long r) {
    if (st.size() <= 1) {
        return true;
    }
    auto itr_l = st.begin(), itr_r = st.end();
    itr_r--;
    if (st.size() <= 2) {
        long long mul = *itr_l * *itr_r;
        return l <= mul && mul <= r;
    }
    auto itr_l2 = itr_l, itr_r2 = itr_r;
    itr_l2++;
    itr_r2--;
    set<long long> cands = {*itr_l * *itr_l2, *itr_l * *itr_r,
                            *itr_r * *itr_r2};
    return l <= *cands.begin() && *cands.rbegin() <= r;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    long long l, r;
    cin >> n >> l >> r;
    vector<long long> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    sort(a.begin(), a.end());
    multiset<long long> st;
    int ans = 1;
    for (int left = 0, right = 0; left < n; left++) {
        while (right < n) {
            st.insert(a[right]);
            if (!is_good(st, l, r)) {
                st.erase(st.find(a[right]));
                break;
            }
            right++;
        }
        ans = max(ans, right - left);
        if (right == left) {
            right++;
        } else {
            st.erase(st.find(a[left]));
        }
    }
    cout << ans << endl;
}