#include <algorithm>
#include <iostream>
#include <vector>

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int n;
    long long l, r;
    std::cin >> n >> l >> r;

    std::vector<long long> a(n);
    for (auto &e : a) std::cin >> e;
    std::sort(a.begin(), a.end());

    std::vector<int> p(n, n), q(n, -1), p2(n), q2(n);
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            if (l <= a[i] * a[j] and a[i] * a[j] <= r) {
                p[i] = std::min(p[i], j);
                q[i] = std::max(q[i], j);
            }
        }
        p2[i] = std::max(p[i], i + 1);
        q2[i] = std::min(q[i], i - 1);
    }

    int ans = 1;
    for (int i = 0; i < n; ++i) {
        for (int j = p2[i]; j <= q[i]; ++j) {
            ans = std::max(ans, 2 + std::max(0, q2[j] - p2[i] + 1));
        }
    }

    std::cout << ans << std::endl;
}