#include <bits/stdc++.h>
using namespace std;
long long n, ans, x, y, c, d, a[1000000];
priority_queue<long long, vector<long long>, greater<long long> > pq;
int main() {
  cin >> n >> x >> y;
  for (int i = 0; i < n; i++) cin >> a[i], pq.push(a[i]);
  if (x > y)
    cout << n;
  else {
    ans = 0;
    while (pq.size()) {
      c = pq.top();
      pq.pop();
      if (c <= x) {
        ans++;
      } else
        break;
      d = pq.top();
      pq.pop();
      pq.push(d + y);
    }
    cout << ans;
  }
  return 0;
}
