#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<vector>
#define N 100000
#define mem(a,b) memset(a,b,sizeof(a))
#define sqr(x)   return x*x
#define abs(x)   return x>0?x:(-x)
typedef long long ll;
//coding........
int  w[N+15];
int n;
int  a,b;
using namespace std;
ll Check(ll ans)
{
    ll sum=0;
    for (int i=0;i<n;i++)
    {
        ll temp=(ll)(w[i]-ans*b);
        if (temp>0)
        {
              sum+= temp/(a-b);
              if (temp%(a-b))
                sum++;
            if (sum>ans||sum<0)
                return 0;
        }
    }
     return 1;
}
int MAX;

int main()
{
    while(~scanf("%d%d%d",&n,&a,&b))
    {
       MAX= 0;
        for(int i=0; i<n; i++)
        {
            scanf("%d",&w[i]);
            MAX= max(MAX, w[i]);
        }
        ll left=0,right=MAX;
        while (left<right)
       {
         ll mid=(left+right)/2;
          if (Check(mid))
            right=mid;
          else
            left=mid+1;
        }
        printf("%lld\n",right);
    }
         return 0;
}
