#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main () {
	int N;
	ll L, R;
	cin >> N >> L >> R;
	ll A[5050];
	for (int i = 0; i < N; i ++) cin >> A[i];
	sort(A, A + N);
	int ans = 1;
	for (int l = 0; l < N - 1; l ++) {
		ll mi = A[l], ma = A[l];
		int n = 1;
		for (int r = l + 1; r < N; r ++) {
			ll x = A[r] * mi, y = A[r] * ma;
			bool ok = L <= min(x, y) && max(x, y) <= R;
			if (ok) {
				n ++;
				ma = A[r];
			}
		}
		ans = max(ans, n);
	}
	cout << ans << endl;
}