#include <bits/stdc++.h>
using namespace std;
int bi_search(vector<int> v, int item) {
  int l = 0, h = v.end() - v.begin() - 1;
  int m;
  while (l < h - 1) {
    m = (l + h) / 2;
    if (item < v[m])
      h = m;
    else if (item >= v[m])
      l = m;
  }
  if (v[h] <= item) return h;
  return l;
}
int main() {
  int n, x, y;
  cin >> n >> x >> y;
  vector<int> v;
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    v.push_back(x);
  }
  sort(v.begin(), v.end());
  if (x > y) {
    cout << n << endl;
  } else {
    int val = bi_search(v, x);
    if (v[val] > x) {
      cout << 0 << endl;
      return 0;
    } else {
      val++;
      int ans = (val + 1) / 2;
      cout << ans << endl;
    }
  }
  return 0;
}
