#include <string.h>
#include <algorithm>
#include <array>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;

int inf = 1001001001;

template <typename T>
struct SegmentTree {
    int n;
    vector<T> dat;
    SegmentTree() {}
    SegmentTree(int N) {
        n = 1;
        while(n < N) {
            n *= 2;
        }
        dat.resize(2*n-1,inf);
    }
    void update(int x, T val) {
        x += n-1;
        dat[x] = val;
        while(x > 0) {
            x = (x-1)/2;
            dat[x] = min(dat[2*x+1],dat[2*x+2]);
        }
    }
    T query(int a, int b, int k, int l, int r) {
        if(r <= a || b <= l) return inf;
        if(a <= l && r <= b) return dat[k];
        T vl = query(a, b, 2*k+1, l, (l+r)/2);
        T vr = query(a, b, 2*k+2, (l+r)/2, r);
        return min(vl, vr);
    }
    T query(int a,int b) {//[a,b)
        return query(a,b,0,0,n);
    }
};

template <typename T>
struct SegmentTree2 {
    int n;
    vector<T> dat;
    SegmentTree2() {}
    SegmentTree2(int N) {
        n = 1;
        while(n < N) {
            n *= 2;
        }
        dat.resize(2*n-1,-inf);
    }
    void update(int x, T val) {
        x += n-1;
        dat[x] = val;
        while(x > 0) {
            x = (x-1)/2;
            dat[x] = max(dat[2*x+1],dat[2*x+2]);
        }
    }
    T query(int a, int b, int k, int l, int r) {
        if(r <= a || b <= l) return -inf;
        if(a <= l && r <= b) return dat[k];
        T vl = query(a, b, 2*k+1, l, (l+r)/2);
        T vr = query(a, b, 2*k+2, (l+r)/2, r);
        return max(vl, vr);
    }
    T query(int a,int b) {//[a,b)
        return query(a,b,0,0,n);
    }
};


int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N,ll,rr;
    cin >> N >> ll >> rr;
    vector<int>A(N);
    vector<int>a;
    int n = 0;
    int cnt = 0;
    for(int i = 0; i < N; i++) {
        cin >> A[i];
        if(A[i] == 0) {
            cnt++;
        }
        else {
            n++;
            a.push_back(A[i]);
        }
    }
    SegmentTree<int>Seg(n);
    SegmentTree2<int>Seg2(n);
    sort(a.begin(),a.end());
    for(int i = 0; i < n; i++) {
        Seg.update(i,a[i]);
        Seg2.update(i,a[i]);
    }
    vector<int>R(n);
    SegmentTree<int>Seg3(n);
    for(int i = 0; i < n; i++) {
        int l = i,r = n;
        while(l+1 < r) {
            int mid = (l+r)/2;
            int mi = Seg.query(i+1,mid+1);
            int mx = Seg2.query(i+1,mid+1);
            if(1ll*mi*a[i] > rr || 1ll*mx*a[i] > rr || 1ll*mi*a[i] < ll || 1ll*mx*a[i] < ll) {
                r = mid;
            }
            else {
                l = mid;
            }
        }
        R[i] = l;
        Seg3.update(i,R[i]);
    }
    int ans = 1;
    for(int i = 0; i < n; i++) {
        int l = i,r = n;
        while(l+1 < r) {
            int mid = (l+r)/2;
            if(Seg3.query(i,mid+1) >= mid) {
                l = mid;
            }
            else {
                r = mid;
            }
        }
        ans = max(ans,l-i+1);
    }
    if(n == 0) ans = 0;
    if(ll <= 0 && 0 <= rr) {
        ans += cnt;
    }
    ans = max(ans,1);
    cout << ans << "\n";
}