#include <iostream>
#include <cstdio>
#include <cmath>
#include <queue>
#include <algorithm>
#include <stack>
using namespace std;
#define mod 1000000007
#define PI acos(-1.0)
typedef long long ll;
const int INF=0x3f3f3f3f;
int d[8][2]={-1,0,0,-1,0,1,1,0,1,1,-1,-1,-1,1,1,-1};
ll n,x,y,k,a[200005],b[200005],num=INF;
int fun(ll mid)
{
    ll sum=0;
    for(int i=n-1;i>=0;i--)
    {
        k=a[i]-mid*y;
        if(k>0)
        {
            sum+=(k+x-y-1)/(x-y);
        }
        else break;
    }
    if(sum>mid) return 0;
    else return 1;
}
int main()
{
    scanf("%lld%lld%lld",&n,&x,&y);
    for(int i=0;i<n;i++)
        scanf("%lld",&a[i]);
    sort(a,a+n);
    ll s=1,e=(a[n-1]+y-1)/y;
    while(s<=e)
    {
        ll mid=(s+e)/2;
        if(fun(mid))
        {
            if(mid<num)num=mid;
            e=mid-1;
        }
        else s=mid+1;
    }
    printf("%lld\n",num);
    return 0;
}
