#include <iostream>
#include <algorithm>
#include <cmath>

using namespace std;

typedef long long LL;
const int maxn = 1e5;
int n, a, b, m[maxn+3];

bool judge(LL x)
{
    LL sum = 0;
    for(int i=0; i<n; ++i)
    {
        LL t = m[i]-x*b;
        if(t>0)
        {
            sum += ceil(t*1.0/(a-b));
            if(sum > x || sum < 0)
                return false;
        }
    }
    return true;
}
int main()
{
    scanf("%d%d%d",&n,&a,&b);
    
    int imax = 0;
    for(int i=0; i<n; ++i) scanf("%d",&m[i]), imax = max(imax, m[i]);
    LL l=0, r=1e14;
    while(l<r)
    {
        LL mid = (l+r)/2;
        if(judge(mid)) r=mid;
        else l=mid+1;
    }
    printf("%lld\n",r);
    
    return 0;
}