#include<bits/stdc++.h>
using namespace std;
long long n,w,b,a[500005],ans;
int f(int mid){
	long long t=0;
	for(int i=1;i<=n;i++){
		if(mid*w>=a[i])continue;
		else t+=ceil(a[i]*1.0/(w+b));
	}
	return t<=mid;
}
int main(){
	cin>>n>>w>>b;
	for(int i=1;i<=n;i++)cin>>a[i];
	int l=1,r=1e9;
	while(l<=r){
		int mid=(l+r)/2;
		if(f(mid)){
			r=mid-1;
			ans=mid;
		}else l=mid+1;
	}
	cout<<ans;
	return 0;
}