#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 len[5050];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>L>>R;
	int ma=1;
	FOR(i,N) {
		cin>>A[i];
	}
	
	sort(A,A+N);
	FOR(i,2) {
		MINUS(len);
		FOR(x,N) for(y=x+1;y<N;y++) {
			int ok=1;
			if(A[x]*A[x+1]<L||A[x]*A[x+1]>R) ok=0;
			if(A[x]*A[y]<L||A[x]*A[y]>R) ok=0;
			if(A[y]*A[y-1]<L||A[y]*A[y-1]>R) ok=0;
			if(ok) {
				len[x]=max(len[x],y);
				ma=max(ma,y-x+1);
			}
		}
		
		FOR(x,N) for(y=x+1;y<N;y++) if(A[x]*A[y]>=L&&A[x]*A[y]<=R&&len[x]<y&&A[len[x]]*A[y]>=L&&A[len[x]]*A[y]<=R) ma=max(ma,len[x]-x+2);
		
		reverse(A,A+N);
	}
	cout<<ma<<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;
}