#include<bits/stdc++.h>
using namespace std;using ll=long long;
int rd(int x=0,char c=getchar()){while(!isdigit(c))c=getchar();while(isdigit(c))x=x*10+(c^48),c=getchar();return x;}
const int N=3e5+5;
int n,x,y,a[N],b[N],c[N];
int main(){
	n=rd(),x=rd(),y=rd();
	for(int i=1,h;i<=n;i++)h=rd(),
	a[i]=ceil(h/1.0/x),b[i]=ceil((h-(h-1)/y*y)/1.0/x),c[i]=ceil(h/1.0/y);
	priority_queue<int> q;int ans=0,w=0;
	for(int i=1;i<=n;i++){
		w+=c[i]-b[i]-1;ans++;q.push(b[i]+1);
		if(w<-1)ans--,w+=q.top(),q.pop();
	}printf("%d",ans);
	return 0;
}