#include <bits/stdc++.h>
const int INF = 1e9, MOD = 1e9 + 7, ohara = 1e6;
const long long LINF = 1e18;
using namespace std;
long long n, cnt, ans, a[ohara], b, c, d, tmp, tmpp, m, h, w, x, y, sum, pos, k;
long double doua;
int dy[] = {1, 0, -1, 0};
int dx[] = {0, 1, 0, -1};
string alph("abcdefghijklmnopqrstuvwxyz"), s;
bool fl;
struct edge {
  int to, cost;
};
int main(void) {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n >> x >> y;
  for (int(i) = 0; (i) < (int)(n); (i)++) cin >> a[i];
  if (x > y)
    cout << (n) << endl;
  else {
    sort(a, a + n);
    for (int i = 0; i < n; i += 2) {
      if (a[i] <= x) {
        cnt++;
      }
    }
    cout << (cnt) << endl;
  }
  return 0;
}
