#include <bits/stdc++.h>
using namespace std;
long long fpow(long long n, long long k, long long p = 1000000007) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
long long inv(long long a, long long p = 1000000007) {
  return fpow(a, p - 2, p);
}
long long spf[1000000 + 1];
void sieve() {
  for (int i = 1; i < 1000000; i++) {
    spf[i] = i;
  }
  for (long long i = 2; i < 1000000; i += 2) {
    spf[i] = 2;
  }
  for (long long i = 3; i < 1000000; i += 2) {
    if (spf[i] == i) {
      for (long long j = i * i; j < 1000000; j += i) {
        spf[j] = min(i, (long long)spf[j]);
      }
    }
  }
}
int main() {
  long long n, x, y;
  cin >> n >> x >> y;
  long long a[n];
  if (x > y) {
    cout << n << endl;
    return 0;
  }
  long long c = 0;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    if (a[i] <= x) {
      c++;
    }
  }
  long long ans = c / 2;
  if (c % 2 == 1) {
    ans++;
  }
  cout << ans << endl;
}
