#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n, x, y;
  cin >> n >> x >> y;
  vector<int> a(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a.begin(), a.end());
  if (x <= y) {
    int cnt = 0;
    for (int i = 0; i < n; i++) {
      if (a[i] <= x)
        cnt++;
      else
        break;
    }
    if (cnt % 2 == 0)
      cout << cnt / 2;
    else
      cout << cnt / 2 + 1;
  } else {
    cout << n;
  }
}
int main() {
  int T = 1;
  while (T--) {
    solve();
  }
  return 0;
}
