#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N;
ll A[5050];
ll L,R;
int P[5050],Q[5050];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>L>>R;
	FOR(i,N) cin>>A[i];
	sort(A,A+N);
	
	FOR(i,N) {
		P[i]=101010,Q[i]=-1;
		FOR(j,N) if(A[i]*A[j]>=L&&A[i]*A[j]<=R) {
			P[i]=min(P[i],j);
			Q[i]=max(Q[i],j);
		}
	}
	int ret=1;
	FOR(i,N) {
		for(j=max(P[i],i+1);j<Q[i];j++) {
			int s=max({P[i],P[j],i+1});
			int t=min({Q[i],Q[j],j-1});
			ret=max(ret,2+max(t-s+1,0));
		}
	}
	
	cout<<ret<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}