#include <bits/stdc++.h>
using namespace std;
int main(){
  int n, l, r;
  cin >> n >> l >> r;
  vector<int> A(n);
  for (int i = 0; i < n; i++){
    cin >> A[i];
  }
  sort(A.begin(), A.end());
  int ans = 1;
  for (int i = 0; i < n; i++){
    long long mn = A[i], mx = A[i];
    for (int j = i + 1; j < n; j++){
      if (!(l <= mn * A[j] && A[j] * mn <= r)){
        break;
      }
      if (!(l <= mx * A[j] && A[j] * mx <= r)){
        break;
      }
      ans = max(ans, j - i + 1);
      mn = min(mn, (long long) A[j]);
      mx = max(mx, (long long) A[j]);
    }
  }
  cout << ans << endl;
}