#include <cstdio>
#include <algorithm>
#define maxn 100010
using namespace std;
typedef long long ll;
int n;
ll a,b,h[maxn];
bool test(ll mid) {
	ll cnt=0;
	for (int i=1;i<=n;i++) {
		ll c=h[i]-mid*b;
		if (c>0) {
			if (c%(a-b)==0)
				cnt+=c/(a-b);
			else cnt+=c/(a-b)+1;
		}
	}
	return cnt<=mid;
}
int main() {
	scanf("%d %lld %lld",&n,&a,&b);
	ll maxh=0;
	for (int i=1;i<=n;i++) {
		scanf("%lld",&h[i]);
		maxh=max(maxh,h[i]);
	}
	ll l=0,r=maxh/b+1;
	while (l<r) {
		ll mid=(l+r)/2;
		if (test(mid))
			r=mid;
		else l=mid+1;
	}
	printf("%lld\n",l);
	return 0;
}