#include<bits/stdc++.h>
#define fi first
#define se second
#define ull unsigned long long
#define make make_pair
#define N 500005
using namespace std;
int read()
{
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
int n,x,y,s[N],cnt=1,ans;
priority_queue<int>q;
signed main()
{
	n=read();x=read();y=read();
	for(int i=1;i<=n;i++)s[i]=read();
	for(int i=1;i<=n;i++)
	{
		int a=s[i]/y-(s[i]%y==0);//可以得到的次数 
		int b=s[i]%y+(s[i]%y==0)*y;//剩余的权值 
		int c=b/x+(b%x!=0);//得分的花费
		cnt+=a;
		if(cnt>=c)
		{
			q.push(c);
			cnt-=c;ans++;
		}
		else
		{
			if(q.size()&&q.top()>c)
			{
				cnt+=q.top()-c;
				q.pop();
				q.push(c);
			}
			cnt++;
		}
	}
	cout<<ans<<"\n";
	return 0;
}