#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)

int main(){
    ll n, a, b;
    cin >> n >> a >> b;
    vector<ll> h(n);
    rep(i, 0, n) cin >> h[i];
    ll L = 0, R = 1e9+10;
    while(R - L > 1){
        ll M = L + (R - L) / 2;
        ll cnt = 0;
        rep(i, 0, n){
            ll rem = max(0LL, h[i] - b * M);
            if(rem > 0) cnt += (rem + (a-b) - 1) / (a-b); 
        }
        if(cnt <= M) R = M;
        else L = M;
    }
    cout << R << endl;
    return 0;
}