#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265359;
const double EPS = 1e-6;
const long long INF = (1LL << 62);
const long long P = 1e9 + 7;
long long res(long long pos, vector<long long> &a, long long sum) {
  if (pos == a.size()) {
    return sum == 0;
  } else {
    return max(res(pos + 1, a, (sum + a[pos]) % 360),
               res(pos + 1, a, ((sum - a[pos]) + 360) % 360));
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n, x, y;
  cin >> n >> x >> y;
  vector<long long> a(n);
  for (long long &x : a) cin >> x;
  sort(a.begin(), a.end());
  if (x > y) {
    cout << n << endl;
    return 0;
  }
  long long pt = 0;
  long long ct = 0;
  long long turn = 0;
  while (pt < n) {
    if (!turn) {
      if (a[pt] - x <= 0) {
        ct++;
        pt++;
      } else {
        break;
      }
    } else {
      pt++;
    }
    turn = !turn;
  }
  cout << ct;
  return 0;
}
