#include <algorithm>
#include <cassert>
#include <cstdint>
#include <iostream>
#include <iterator>
#include <vector>

// <TLE>
// O(n^3) 時間
int main() {
  constexpr int kMaxN = 5000, kMinA = -1000000000, kMaxA = 1000000000;

  int n, l, r;
  std::cin >> n >> l >> r;
  assert(1 <= n && n <= kMaxN && kMinA <= l && l <= r && r <= kMaxA);
  std::vector<std::int64_t> a(n);
  for (int i = 0; i < n; ++i) {
    std::cin >> a[i];
    assert(kMinA <= a[i] && a[i] <= kMaxA);
  }
  std::ranges::sort(a);

  int ans = 1;
  for (int i = 0; i < n; ++i) {
    int j = i + 1;
    for (; j < n; ++j) {
      if (!std::all_of(std::next(a.begin(), i), std::next(a.begin(), j),
                       [l, r, &a, j](const std::int64_t x) -> bool {
                         return l <= x * a[j] && x * a[j] <= r;
                       })) {
        break;
      }
    }
    ans = std::max(ans, j - i);
  }
  if (ans == 1) {
    for (int i = 0; ans == 1 && i < n; ++i) {
      for (int j = i + 1; j < n; ++j) {
        if (l <= a[i] * a[j] && a[i] * a[j] <= r) {
          ans = 2;
          break;
        }
      }
    }
  }
  std::cout << ans << '\n';
  return 0;
}