#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef unsigned long long LL;
const int maxn = 100009;
LL n, A, B, h[maxn];
LL l = 0, r = 9e18, mid;
bool check(LL x){
LL res = 0;
for (LL i=1; i<=n; i++)
if (h[i] > B*x)
res += (h[i]-B*x+A-B-1)/(A-B);
return res <= x;
}
int main(){
scanf("%llu%llu%llu", &n, &A, &B);
for (LL i=1; i<=n; i++) scanf("%llu", &h[i]);
while (l < r){
mid = (l+r) >> 1;
if (check(mid)) r = mid;
else l = mid + 1;
}
printf("%llu\n", l);
return 0;
}