#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, x, y;
  vector<int> a;
  cin >> n >> x >> y;
  int ans = 0;
  a.resize(n);
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  sort(a.begin(), a.end());
  int i = 0;
  while (i < a.size()) {
    ++i;
    if (a[i] > x) break;
  }
  if (x > y) {
    cout << a.size();
    return 0;
  } else {
    int j = 0, k = i - 1, count = 0;
    while (j < i && k >= 0) {
      count = ceil((x - a[k] + y) / y);
      if (count > (k - j)) {
        break;
      } else {
        --k;
        ++j;
      }
    }
    cout << (k + 1);
    return 0;
  }
}
