#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

ll my_pow(ll x, ll n, ll mod) {
    // 　繰り返し二乗法．x^nをmodで割った余り．
    ll ret;
    if (n == 0) {
        ret = 1;
    } else if (n % 2 == 1) {
        ret = (x * my_pow((x * x) % mod, n / 2, mod)) % mod;
    } else {
        ret = my_pow((x * x) % mod, n / 2, mod);
    }
    return ret;
}

ll inv(ll x, ll mod) { return my_pow(x, mod - 2, mod); }

ll my_gcd(ll a, ll b) {
    ll ret = 0;
    if (a < b) {
        swap(a, b);
    }
    if (b == 0) {
        ret = a;
    } else {
        ret = my_gcd(b, a % b);
    }
    return ret;
}

int main() {
    ll n, l, r;
    cin >> n >> l >> r;
    vector<ll> A(n);
    for (ll i = 0; i < n; i++) {
        cin >> A[i];
    }
    if (r < 0) {
        // 答えは最大でも 2
        ll ans = 1;
        for (ll i = 0; i < n; i++) {
            for (ll j = i + 1; j < n; j++) {
                if (A[i] * A[j] >= l && A[i] * A[j] <= r) {
                    ans = 2;
                }
            }
        }
        cout << ans << endl;
    } else {
        vector<ll> neg(0);
        vector<ll> pos(0);
        ll zero = 0;
        for (ll i = 0; i < n; i++) {
            if (A[i] == 0) {
                zero++;
            } else if (A[i] < 0) {
                neg.push_back(A[i]);
            } else {
                pos.push_back(A[i]);
            }
        }
        sort(all(neg));
        sort(all(pos));
        reverse(all(neg));
        // 区間の中の最大値，もしくは最小値がわかれば OK
        if (l < 0 && r == 0) {
            ll ans = zero;
            if (ans == n) {
                cout << ans << endl;
            } else if (ans == n - 1) {
                cout << ans + 1 << endl;
            } else {
                ans++;
                for (ll i = 0; i < n; i++) {
                    for (ll j = i + 1; j < n; j++) {
                        if (A[i] * A[j] >= l && A[i] * A[j] < 0) {
                            ans = zero + 2;
                        }
                    }
                }
                cout << ans << endl;
            }
        } else if (l == 0 && r == 0) {
            ll ans = zero;
            if (zero < n) {
                ans++;
            }
            cout << ans << endl;
        } else if (l < 0 && r > 0) {
            ll pos_lim = 0;
            ll neg_lim = 0;
            if (zero == n){
                cout << n << endl;
                return 0;
            }
            if (pos.size() > 0) {
                for (ll i = 0; i < pos.size() - 1; i++) {
                    if (pos[i] * pos[i + 1] <= r) {
                        pos_lim = i + 1;
                    }
                }
            }
            if (neg.size() > 0) {
                for (ll i = 0; i < neg.size() - 1; i++) {
                    if (neg[i] * neg[i + 1] <= r) {
                        neg_lim = i + 1;
                    }
                }
            }
            ll ans = max(pos_lim + 1, neg_lim + 1);
            if (pos.size() > 0 && neg.size() > 0) {
                for (ll i = 0; i <= pos_lim; i++) {
                    for (ll j = 0; j <= neg_lim; j++) {
                        if (pos[i] * neg[j] >= l) {
                            ans = max(ans, i + j + 2);
                        }
                    }
                }
            }
            cout << ans + zero << endl;
        } else if (l == 0 && r > 0) {
            ll ans = zero;
            if (zero == n) {
                cout << ans << endl;
                return 0;
            }
            ll pos_lim = 0;
            ll neg_lim = 0;
            for (ll i = 0; i < pos.size() - 1; i++) {
                if (pos[i] * pos[i + 1] <= r) {
                    pos_lim = i + 1;
                }
            }
            for (ll i = 0; i < neg.size() - 1; i++) {
                if (neg[i] * neg[i + 1] <= r) {
                    neg_lim = i + 1;
                }
            }
            cout << zero + max(pos_lim, neg_lim) + 1 << endl;
        } else if (l > 0 && r > 0) {
            ll ans = 1;
            for (ll i = 0; i < pos.size(); i++) {
                for (ll j = i + 1; j < pos.size(); j++) {
                    if (pos[i] * pos[i + 1] >= l && pos[j - 1] * pos[j] <= r) {
                        ans = max(ans, j - i + 1);
                    }
                }
            }
            for (ll i = 0; i < neg.size(); i++) {
                for (ll j = i + 1; j < neg.size(); j++) {
                    if (neg[i] * neg[i + 1] >= l && neg[j - 1] * neg[j] <= r) {
                        ans = max(ans, j - i + 1);
                    }
                }
            }
            cout << ans << endl;
        }
    }
}