#include <bits/stdc++.h>
using namespace std;
const int M = 1e2 + 2;
int n, t[M], x, y, res;
int main() {
  cin >> n >> x >> y;
  for (int i = 0; i < n; i++) cin >> t[i];
  sort(t, t + n);
  if (x > y) {
    cout << n;
    return 0;
  }
  bool k = 0;
  for (int i = 0; i < n; i++) {
    if (t[i] > x) break;
    if (!k) {
      res++;
      k = 1;
      continue;
    }
    if (k) k = 0;
  }
  cout << res;
}
