#include <bits/stdc++.h>
using namespace std;


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

    long long N,L,R; cin >> N >> L >> R;
    vector<long long> A(N);
    for(auto &a : A) cin >> a;
    sort(A.begin(),A.end());

    vector<pair<int,int>> range(N);
    for(int i=0; i<N; i++){
        long long l = L,r = R,a = A.at(i),mina,maxa;
        if(a < 0){mina = r/abs(a)*(-1),maxa = (l-a-1)/abs(a)*(-1);}
        else if(a == 0){
            if(l <= 0 && 0 <= r){mina = -1e18; maxa = 1e18;}
            else{mina = 1e18; maxa = -1e18;}
        }
        else{mina = (l+a-1)/a; maxa = r/a;}

        int posl = lower_bound(A.begin()+i+1,A.end(),mina)-A.begin();
        int posr = upper_bound(A.begin()+i+1,A.end(),maxa)-A.begin();
        posr--;
        range.at(i) = {posl,posr};
    }

    vector<int> B(N,1);
    for(int i=0; i<N; i++){
        auto[l,r] = range.at(i);

        int now = 1;
        for(int k=l; k<=r; ){
            now++;
            auto[l2,r2] = range.at(k);
            k = max(k+1,l2); r = min(r2,r);
        }
        B.at(i) = now;
    }

    int answer = *max_element(B.begin(),B.end());
    cout << answer << endl;

}