#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ln cout<<'\n'
#define ll long long
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.12f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}void pr(){ln;}
template<class A,class...B>void pr(const A &a,const B&...b){cout<<a<<(sizeof...(b)?" ":"");pr(b...);}
template<class A>void PR(A a,ll n){rep(i,n)cout<<(i?" ":"")<<a[i];ln;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[8]={-1,0,1,0,-1,-1,1,1},dy[8]={0,1,0,-1,-1,1,1,-1};
typedef pair<ll,ll> P;

void Main() {
  ll n,l,r;
  cin >> n >> l >> r;
  ll a[n];
  rep(i,n) cin >> a[i];
  sort(a,a+n);
  ll ans=1;
  rep(i,n) {
    vector<ll> v[2][2];
    if(a[i]<0) {
      v[0][0].pb(a[i]);
      v[0][1].pb(a[i]);
    } else {
      v[1][0].pb(a[i]);
      v[1][1].pb(a[i]);
    }
    rep(k,2) {
      sort(all(v[k][0]),greater<ll>());
      sort(all(v[k][1]));
      while(v[k][0].size()>2) v[k][0].pop_back();
      while(v[k][1].size()>2) v[k][1].pop_back();
    }
    REP(j,i+1,n) {
      if(a[j]<0) {
        v[0][0].pb(a[j]);
        v[0][1].pb(a[j]);
      } else {
        v[1][0].pb(a[j]);
        v[1][1].pb(a[j]);
      }
      rep(k,2) {
        sort(all(v[k][0]),greater<ll>());
        sort(all(v[k][1]));
        while(v[k][0].size()>2) v[k][0].pop_back();
        while(v[k][1].size()>2) v[k][1].pop_back();
      }
      vector<ll> b;
      rep(x,2) {
        rep(y,2) {
          if(y&&v[x][y].size()==1) continue;
          rep(z,v[x][y].size()) b.pb(v[x][y][z]);
        }
      }
      ll Mi=MAXL,Ma=-MAXL;
      rep(x,b.size()) {
        REP(y,x+1,b.size()) {
          Mi=min(Mi,b[x]*b[y]);
          Ma=max(Ma,b[x]*b[y]);
        }
      } 
      if(l<=Mi&&Mi<=r&&l<=Ma&&Ma<=r) ans=max(ans,j-i+1);
    }
  }
  pr(ans);
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}