#include<iostream>
using namespace std;
#define ll long long 
#define max 1e5+1

int n;
ll c[100001];
ll a,b;
ll l,r=1e9+10;

ll search(ll m){
  ll an=0;
  for(int i=0;i<n;i++){
    if(b*m>=c[i]);
    else{
      an+=(c[i]-b*m)/(a-b);
      if((c[i]-b*m)%(a-b)!=0) an++;
    }
  }
  return an;
}

int main(){
  cin>>n>>a>>b;
  for(int i=0;i<n;i++)
    cin>>c[i];

  while(r-l!=1){
    ll m = (r+l)/2;
    ll an = search(m);
    if(an<=m) r=m;
    else l = m;
  }

  cout<<r<<endl;

  return 0;
}

