#include<bits/stdc++.h>
using namespace std;
int n,a,b;
int w[100001];
bool cmp(long long a,long long b)
{
	return a>b;
}
bool chick(int x)
{
	int h=0;
	for(int i=1;i<=n;i++)
	{
		if(x*a>=w[i]) continue;
		else
		{
			h+=(w[i]-a*x)/b;
			if((w[i]-a*x)%b>0)
				h++;
		}
	}
	if(h>x)
		return false;
	else 
		return true;
}
int main()
{
	cin>>n>>a>>b;
	for(int i=1;i<=n;i++)
	{
		scanf("%lld",&w[i]);
	}
	int l=0,r=1e6*5,mid;
	sort(w+1,w+n+1,cmp);
	while(l<r)
	{
		mid=(l+r)/2;
		if(chick(mid))
			r=mid;
		else
			l=mid+1;
	}
	cout<<r;
	return 0;
}