#include <bits/stdc++.h>
using namespace std;
int arr[1000000],n,a,b;

bool check(int mins){
	int sum=0;
	int ar;
	for(int i=1;i<=n;i++){
		ar=arr[i]-mins*a;
		if(ar<=0) continue;
		sum+=ar/b;
		if(ar%b!=0) sum++;
		if(ar>mins) return 0;
	}
	return sum<=mins;
} 

int binary_search(int l,int r){
	while(l!=r){
		int mid=(l+r)>>1;
		if(check(mid)){
			r=mid;
		}else{
			l=mid+1;
		}
	}
	return l;
}

int main(){
	cin>>n>>a>>b;
	for(int i=1;i<=n;i++){
		cin>>arr[i];
	}
	cout<<binary_search(0,500010);
}

89pts，#4 WA