#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, l, r;
  cin >> n >> l >> r;
  r++;
  VL a(n);
  rep(i, n) cin >> a[i];
  sort(all(a));
  int ans = 1;
  rep(j, n) rep(i, j) {
    ll x = a[i], y = a[j];
    ll xy = x * y;
    if (!(l <= xy && xy < r)) continue;
    chmax(ans, 2);
    constexpr long long INF = 1002003004005006007;
    auto ceildiv = [](ll n, ll d) {
      return n / d + ((n ^ d) > 0 && n % d != 0);
    };
    auto floordiv = [](ll n, ll d) {
      return n / d - ((n ^ d) < 0 && n % d != 0);
    };
    auto f = [&](ll x) {
      if (x > 0) {
        return pair(ceildiv(l, x), ceildiv(r, x));
      } else if (x == 0) {
        if (l <= 0 && 0 < r) return pair(-INF, INF);
        else return pair(0LL, 0LL);
      } else {
        return pair(floordiv(r, x) + 1, floordiv(l, x) + 1);
      }
    };
    auto [m1, M1] = f(x);
    auto [m2, M2] = f(y);
    ll m = max({m1, m2, x}), M = min({M1, M2, y + 1});
    if (m >= M) continue;
    int cnt = lower_bound(all(a), M) - lower_bound(all(a), m);
    for (ll z : {x, y}) cnt -= m <= z && z < M;
    chmax(ans, cnt + 2);
  }
  cout << ans << '\n';
}