
#include <iostream>
#include <string.h>
#include <algorithm>
#include <vector>
#include <queue>

using namespace std;
typedef long long ll;
const ll INF=10000000000000000LL;
int n,a,b,h[100001];
bool cheak(ll c){
	ll s=0;
	for(int i=0;i<n;++i){
		if(h[i]>b*c){
			s+=(h[i]-b*c)/(a-b);
			if((h[i]-b*c)%(a-b))++s;
		}
	}
	if(s<=c)return true;
	return false;
}
ll reg(int l,int r){
	if(l==r)return l;
	ll c=(l+r)/2;
	if(cheak(c)){
		if(l+1==r)return l;
		return reg(l,c);
	}else{
		return reg(c+1,r);
	}
}
int main() {
	cin>>n>>a>>b;
	for(int i=0;i<n;++i)cin>>h[i];
	cout<<reg(0,1000000000)<<endl;
	return 0;
}
