#include<bits/stdc++.h>
#define pb push_back
#define P make_pair
#define fi first
#define se second
#define bit(s,x) (((s)>>(x))&1)
#define pnp(s) __builtin_popcountll(s)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
typedef long long ll; 
typedef unsigned long long ull;
typedef pair<int,int> pii;
inline ll read(){
	ll x=0,f=1,c=getchar();
	while(c<'0'||c>'9')f=(c=='-'?-1:1),c=getchar();
	while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return x*f;
}
const int N=3e5+3;
int n,A,B,h[N],a[N],b[N];
ll f[N];
int main() {
    //freopen("data.in", "r", stdin);
    // freopen("myans.out","w",stdout);
	n=read(),A=read(),B=read();
	rep(i,1,n){
		h[i]=read();
		int c=(h[i]-1)/B,d=(h[i]-1)%B+1;
		a[i]=c+1;
		if(A>=B) b[i]=c-1;
		else b[i]=c-(d-1)/A-1;
	}
	rep(i,1,n)f[i]=-1;
	f[0]=1;
	rep(i,1,n){
		static ll g[N];
		rep(j,0,i)g[j]=-1;
		rep(j,0,i-1)if(~f[j]){
			g[j]=max(g[j],f[j]+a[i]);
			if(f[j]+b[i]>=0)g[j+1]=max(g[j+1],f[j]+b[i]);
		}
		rep(j,0,i)f[j]=g[j];
	}
	per(i,n,0)if(~f[i]){
		printf("%d",i);
		return 0;
	}
    return 0;
}