#include <bits/stdc++.h>
using namespace std;
#define int long long
int mod = 998244353;
signed main(){
    int N,L,R;
    cin>>N>>L>>R;
    int ans = 1;
    vector<int> A = {}, B = {};
    int ad = 0;
    for(int i=0;i<N;i++){
    	int a;
    	cin>>a;
    	if(a == 0) ad++;
    	else if(a < 0) A.push_back(-a);
    	else B.push_back(a);
    }
    sort(A.rbegin(),A.rend());
    sort(B.rbegin(),B.rend());
    while(A.size() > 1 && A[A.size()-1]*A[A.size()-2] < L) A.pop_back();
    while(B.size() > 1 && B[B.size()-1]*B[B.size()-2] < L) B.pop_back();
    reverse(A.begin(),A.end());
    reverse(B.begin(),B.end());
    while(A.size() > 1 && A[A.size()-1]*A[A.size()-2] > R) A.pop_back();
    while(B.size() > 1 && B[B.size()-1]*B[B.size()-2] > R) B.pop_back();
    int n = A.size(), m = B.size();
    vector<int> LL(n,1e18), RR(n,-(1e18));
    for(int i=0;i<n;i++)for(int j=0;j<m;j++)if(L <= A[i]*B[j] && A[i]*B[j] <= R){
    	LL[i] = min(LL[i],j);
    	RR[i] = min(RR[i],j);
    }
    for(int i=0;i<n;i++)for(int j=i;j<n;j++){
    	int a = max(LL[i],LL[j]), b = min(RR[i],RR[j]);
    	if(a > b) continue;
    	ans = max(ans,j-i+1+b-a+1);
    }
    cout<<max({ans,(int)(A.size()),(int)(B.size())})+(L<=0&&0<=R)*ad<<endl;
}