#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

 
int main(){
  ll n, a, b, c;
  cin >> n >> a >> b;
  c = a - b;
  ll hi[n];
  for(int i=0; i<n; i++){
    cin >> hi[i];
  }
  ll mint=-1, maxt=1000000007;
  while(maxt-mint>1){
    ll mid = (mint+maxt)/2;
    ll tmp = 0;
    for(int i=0; i<n; i++){
      if(hi[i]-b*mid>0){
        tmp += (hi[i]-b*mid+a-b-1)/c;
      }
    }
    if(mid < tmp) mint = mid;
    else maxt = mid;
  }
  cout << maxt << endl;
  return 0;
}
