#include <bits/stdc++.h>
using namespace std;
long long n, x, y, r, nr, i, ceva, ok;
int a[100005];
int main() {
  cin >> n >> x >> y;
  for (i = 1; i <= n; i++) cin >> a[i];
  sort(a + 1, a + n + 1);
  if (x - y > 0)
    cout << n;
  else {
    ceva = 0;
    ok = 1;
    for (i = 1; i <= n; i++) {
      r = a[i];
      if (r + ceva <= x) {
        nr++;
        ceva += y;
        ok = 0;
      } else if (ok == 0) {
        ok = 1;
        ceva -= y;
      }
    }
    cout << nr;
  }
  return 0;
}
