#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <math.h>
#define MOD 1000000007
typedef long long ll;
using namespace std;

int main(){
  ll n,a,b;
  cin>>n>>a>>b;
  ll h[n+1],m=0;
  for(ll i=1;i<=n;i++){
    cin>>h[i];
    m=max(m,h[i]);
  }
  ll r=m/b+1,l=0;
  while(l<r){
    ll mid=(l+r)/2;
    ll tmp=0;
    for(ll j=1;j<=n;j++){
      if(h[j]<=b*mid) continue;
      tmp+=((h[j]-b*mid)+a-b-1)/(a-b);
    }
    if(tmp<=mid){
      r=mid;
    }else{
      l=mid+1;
    }
  }
  //cout<<l<<" "<<r<<endl;
  cout<<l<<endl;
  return 0;
}
