#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007LL, INF = 1e9, LINF = 1e18;
long long GT(int x) { return (x <= 1) ? 1 : x * GT(x - 1); }
long long tohop(long long n, long long k) {
  long long c = 1;
  for (long long i = 1; i <= k; i++, n--) c = c * n / i;
  return c;
}
bool isPrime(int n) {
  for (int i = 2; i * i <= n; ++i) {
    if (n % i == 0) {
      return false;
    }
  }
  return true;
}
void solve() {
  long long n, x, y, cnt = 0;
  cin >> n >> x >> y;
  long long a[n];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    if (a[i] <= x) cnt++;
  }
  if (x > y)
    cout << n << endl;
  else {
    (cnt % 2 == 0) ? cout << cnt / 2 << endl : cout << cnt / 2 + 1 << endl;
  }
  return;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  solve();
  return 0;
}
