#include <bits/stdc++.h>
#define clr(f, n) memset(f, 0, (n) << 2)
#define cpy(f, g, n) memcpy(f, g, (n) << 2)
typedef long long LL;
typedef unsigned long long ULL;
typedef __int128 LLL;
typedef std::pair<int, int> pii;
#define MP std::make_pair
#define fi first
#define se second
int read()
{
	int s = 0, f = 1;
	char c = getchar();
	while (!(c >= '0' && c <= '9'))
		f ^= (c == '-'), c = getchar();
	while (c >= '0' && c <= '9')
		s = s * 10 + (c ^ 48), c = getchar();
	return f ? s : -s;
}
const int MAXN = 300005;
int n, h[MAXN], A, B;
int a[MAXN], b[MAXN];
std::priority_queue<int> q;
int main()
{
	n = read(), A = read(), B = read();
	for (int i = 1; i <= n; i++) h[i] = read() - 1;
	for (int i = 1; i <= n; i++) 
		a[i] = (h[i] % B) / A + 1, b[i] = h[i] / B + 1;
	int sum = 1;
	for (int i = 1; i <= n; i++)
	{
		sum += b[i] - a[i] - 1, q.push(a[i] + 1);
		if (sum < 0) sum += q.top(), q.pop();
	}
	printf("%d\n", q.size());
	return 0;
}