#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> P;
#define REP(i,n) for(int i=0;i<int(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++){
		ll L=2e18,R=-2e18,s=1;
		for(j=i+1;j<n;j++){
			R=max({R,a[i]*a[j],a[j]*a[j-1]});
			L=min({L,a[i]*a[j],a[j]*a[j-1]});

			if(r>=R && l<=L){
				s++;
			}
		}

		mx=max(mx,s);
	}

	cout << mx << endl;


	return 0;
}