#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 1;


void solve(){
    ll n, l, r; cin >> n >> l >> r;
    vector<ll> a(n); rep(i, n) cin >> a[i];
    sort(all(a));

    ll ans = 1;

    for(ll i=0; i<n-1; i++) for(ll j=i+1; j<n; j++){
        if(l <= a[i]*a[j] && a[i]*a[j]<=r) ans = max(ans, 2LL);
        if(a[i]<=0 && a[j]<=0){
            if(l<=a[j-1]*a[j] && a[i]*a[i+1]<=r) ans = max(ans, j-i+1);
        }
        if(a[i]<=0 && a[j]>=0){
            if(l <= a[i]*a[j] && max(a[i]*a[i+1], a[j-1]*a[j]) <= r) ans = max(ans, j-i+1);
        }
        if(a[i]>=0 && a[j]>=0){
            if(l<=a[i]*a[i+1] && a[j-1]*a[j]<=r) ans = max(ans, j-i+1);
        }
    }

    cout << ans << endl;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int T=1;
    //cin >> T;
    while(T--) solve();
}