#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> P;
#define REP(i,n) for(ll i=0;i<ll(n);i++)



int main(void){
	cin.tie(nullptr);  ios_base::sync_with_stdio(false);
	ll i,j,k;

	ll n,l,r;
	cin >> n >> l >> r;

	vector<ll> a(n);
	for(i=0;i<n;i++) cin >> a[i];

	sort(a.begin(),a.end());
	reverse(a.begin(),a.end());

	ll mx=1;
	for(i=0;i<n-1;i++){
		vector<ll> v;
		v.push_back(a[i]);
		for(j=i+1;j<n;j++){

			ll R=max(a[i]*a[j],a[j]*v.back());
			ll L=min(a[i]*a[j],a[j]*v.back());

			if(r>=R && l<=L){
				v.push_back(a[j]);
			}
		}

		ll m=v.size();
		mx=max(mx,m);
	}

	cout << mx << endl;


	return 0;
}