#include<bits/stdc++.h>
using namespace std;
inline int read(){int s=0,f=1;char c=getchar();while(c<'0'||c>'9'){if(c=='-')f*=-1;c=getchar();}while(c>='0'&&c<='9')s=(s<<1)+(s<<3)+(c^48),c=getchar();return s*f;}
const int N=300010;
int n,a,b,h[N],gt[N]/*a补刀需要步数*/,ungt[N]/*b独自杀掉怪物所需步数*/,cnt,ans;
int up(int x,int y){return x%y?x/y+1:x/y;}/*向上取整*/
priority_queue<int ,vector<int>,less<int> > Q;/*大根堆*/
int main(){
	n=read(),a=read(),b=read(),cnt=1/*先手初始就有1步*/;
	for(int i=1;i<=n;++i)h[i]=read(),gt[i]=up((h[i]-1)%b+1,a),ungt[i]=up(h[i],b);
	for(int i=1;i<=n;++i){
		cnt+=ungt[i];
		if(cnt>=gt[i]+1)cnt-=gt[i]+1,++ans,Q.push(gt[i]+1);
		else if(!Q.empty()&&Q.top()>gt[i]+1)cnt+=Q.top()-gt[i]-1,Q.pop(),Q.push(gt[i]+1); 
	}
	printf("%d\n",ans);
	return 0;
}