#include <iostream>
#include <vector>
using namespace std;
int main(){
  long long n,a,b;cin>>n>>a>>b;
  vector<long long> A(n);
  long long mn = 0;
  long long mx = 0;
  for(int i = 0; n > i; i++){
    cin>>A[i];
    mx = max(mx,(A[i]-1)/b+1);
  }
  long long ce = (mx+mn)/2;
  while(mx-mn > 1){
    long long wan = 0;
    for(long long i = 0; n > i; i++){
      if(A[i]-(ce*b) > 0){
        wan += ((A[i]-(ce*b))-1)/(a-b)+1;
      }
    }
    if(wan > ce){
      mn = ce;
    }else{
      mx = ce;
    }
    ce = (mx+mn)/2;
  }
  cout << mx << endl;
}
