#include <bits/stdc++.h>
#define IL inline
#define LL long long
#define eb emplace_back
#define L(i, j, k) for (int i = (j); i <= (k); ++i)
#define R(i, j, k) for (int i = (j); i >= (k); --i)
using namespace std;

using vi = vector<int>;
using cint = const int;

using pii = pair<int, int>;
#define fi first
#define se second

constexpr int N = 3e5 + 9;
int n, a, b, h[N], c[N], d[N];

int main () {
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> n >> a >> b;
	L (i, 1, n) cin >> h[i];
	L (i, 1, n) {
		int r = (h[i] - 1) % b + 1;
		c[i] = (r + a - 1) / a;
		d[i] = (h[i] + b - 1) / b;
	}
	priority_queue<int> q;
	int x = 0, y = 1;
	L (i, 1, n) {
		q.emplace(c[i] + 1);
		y += d[i] - c[i] - 1;
		if (y < 0) {
			y += q.top();
			q.pop();
		} else {
			++x;
		}
	}
	cout << x << '\n';
}
// I love WHQ!