#include<bits/stdc++.h>
using namespace std;
namespace my_std{
	#define ll long long
	#define bl bool
	ll my_pow(ll a,ll b,ll mod){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res=(res*a)%mod;
			a=(a*a)%mod;
			b>>=1;
		}
		return res;
	}
	ll qpow(ll a,ll b){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res*=a;
			a*=a;
			b>>=1;
		}
		return res;
	}
	#define db double
	#define pf printf
	#define pc putchar
	#define fr(i,x,y) for(register ll i=(x);i<=(y);i++)
	#define pfr(i,x,y) for(register ll i=(x);i>=(y);i--)
	#define go(u) for(ll i=head[u];i;i=e[i].nxt)
	#define enter pc('\n')
	#define space pc(' ')
	#define fir first
	#define sec second
	#define MP make_pair
	#define il inline
	#define inf 8e18
	#define random(x) rand()*rand()%(x)
	#define inv(a,mod) my_pow((a),(mod-2),(mod))
	il ll read(){
		ll sum=0,f=1;
		char ch=0;
		while(!isdigit(ch)){
			if(ch=='-') f=-1;
			ch=getchar();
		}
		while(isdigit(ch)){
			sum=sum*10+(ch^48);
			ch=getchar();
		}
		return sum*f;
	}
	il void write(ll x){
		if(x<0){
			x=-x;
			pc('-');
		}
		if(x>9) write(x/10);
		pc(x%10+'0');
	}
	il void writeln(ll x){
		write(x);
		enter;
	}
	il void writesp(ll x){
		write(x);
		space;
	}
}
using namespace my_std;
priority_queue<ll> q;
ll n,A,B,h[300030],a[300030],b[300030];
int main(){
	n=read();
	A=read();
	B=read();
	fr(i,1,n) h[i]=read();
	fr(i,1,n) a[i]=((h[i]-1)%B+1+A-1)/A;
	fr(i,1,n) b[i]=(h[i]+B-1)/B;
	ll sum=0,ans=0;
	fr(i,1,n){
		if((sum+b[i]-1-a[i])>=-1){
			sum+=b[i]-1-a[i];
			q.push(a[i]+1);
			ans++;
		}
		else if(!q.empty()){
			ll u=q.top();
			if((u+b[i]-1-a[i])>0){
				sum+=u+b[i]-1-a[i];
				q.pop();
				q.push(a[i]+1);
			}
			else sum+=b[i];
		}
		else sum+=b[i];
	}
	write(ans);
}