#include<bits/stdc++.h>
using namespace std;
int n,m,k,s,t,a,b,w[500005];
int check(int x){
	int cnt=0;
	for (int i=1;i<=n;++i){
		long long tmp=w[i]-1ll*x*a;
		if (tmp>0) {
			if (tmp%b==0) cnt+=tmp/b;
			else cnt+=tmp/b+1;
		}
	} 
	return cnt<=x;
}
int main(){
	cin>>n>>a>>b;
	for (int i=1;i<=n;++i) cin>>w[i];
	int l=1,r=500000;
	while (l<=r){
		int mid=(l+r)/2;
		if (check(mid)) r=mid-1;
		else l=mid+1;
	}
	cout<<l;
}