#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
const double eps = 1e-12;
inline int sign(double x) { return x < -eps ? -1 : x > eps; }
inline int realcmp(double x, double y) { return sign(x - y); }
template <class T>
void na(vector<T>& a, int n) {
  a = vector<T>(n);
  for (T& i : a) cin >> i;
}
template <class T>
void printVector(vector<T>& a) {
  for (T& i : a) cout << i << ' ';
  cout << '\n';
}
template <class T>
vector<T> shrink(vector<T>& x) {
  vector<T> vals = x;
  sort((vals).begin(), (vals).end());
  (vals).resize(unique((vals).begin(), (vals).end()) - (vals).begin());
  for (T& i : x)
    i = upper_bound((vals).begin(), (vals).end(), i) - vals.begin();
  return vals;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0), cout.tie();
  int n;
  long long int x, y;
  cin >> n >> x >> y;
  if (x > y) return !(cout << n << '\n');
  vector<long long int> a;
  na(a, n);
  multiset<long long int> s;
  for (long long int i : a) s.insert(i);
  int ans = 0;
  while (((int)(s).size()) && *s.begin() <= x) {
    auto it = s.upper_bound(x);
    it--;
    s.erase(it);
    ++ans;
    if (((int)(s).size()) && *s.begin() <= x) {
      it = s.upper_bound(x);
      --it;
      long long int tmp;
      if ((tmp = *it + y) > x)
        s.erase(it);
      else {
        s.erase(it);
        s.insert(tmp);
      }
    }
  }
  cout << ans << '\n';
  return 0;
}
