#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
#define rep(i, n) for(int i=0;i<(n);++i)
#define rep1(i, n) for(int i=1;i<=(n);i++)
#define ll long long
using mint = modint998244353;
using P = pair<ll,ll>;
using lb = long double;
using T = tuple<ll, ll, ll>;
#ifdef LOCAL
#  include <debug_print.hpp>
#  define dbg(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define dbg(...) (static_cast<void>(0))
#endif

int main()
{
    ll n, l, r;
    cin >> n >> l >> r;
    vector<ll> a(n);
    rep(i,n) cin >> a[i];
    int ans = 1;
    sort(a.begin(),a.end());
    rep(i,n){
        ll m = -1e18;
        ll M = 1e18;
        for(int j=i+1;j<n;j++){
            m = max(m, a[j]*a[j-1]);
            M = min(M, a[j]*a[j-1]);
            M = min(M, a[i]*a[i+1]);
            m = max(m, a[i]*a[i+1]);
            m = max(m, a[i]*a[j]);
            M = min(M, a[j]*a[i]);
            if(m<=r && M>=l) ans = max(ans, j-i+1);
        }
    }
    rep(i,n){
        ll m = -1e18;
        ll M = 1e18;
        for(int j=i+1;j<n;j++){
            if(a[j]==0) continue;
            m = max(m, a[j]*a[j-1]);
            M = min(M, a[j]*a[j-1]);
            M = min(M, a[i]*a[i+1]);
            m = max(m, a[i]*a[i+1]);
            m = max(m, a[i]*a[j]);
            M = min(M, a[j]*a[i]);
            if(m<=r && M>=l) ans = max(ans, j-i+1);
        }
    }
    cout << ans << endl;
    return 0;
}