#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
const int maxn = 500005;
int n;
long long a,b,s[maxn];
bool check(int k) {
    int cnt = 0;
    for(int i = 1;i <= n;++ i) {
        if(s[i] <= (long long)1ll * k * a)continue ;
        long long val = s[i] - (long long)(1ll * k * a);
        cnt += ceil((double)(1.0 * val / (double)b));
    }
    return cnt <= k;
}
int main() {
    freopen("dry.in","r",stdin);
    freopen("dry.out","w",stdout);
    scanf("%d%lld%lld",&n,&a,&b);
    for(int i = 1;i <= n;++ i)scanf("%lld",&s[i]);
    int l = 1,r = maxn,mid;
    while(l <= r) {
        mid = l + r >> 1;
        if(check(mid))r = mid - 1;
        else l = mid + 1;
    }
    printf("%d\n",l);
    fclose(stdin);
    fclose(stdout);
    return 0;
}