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

int main(){
  int n, a, b;
  cin >> n >> a >> b;
  vector<int> an(n);
  for(int i=0; i<n; ++i) cin >> an[i];
  int l=0, r= 999999999 /b +1;
  while(l < r-1){
    int mid = (l+r)/2;
    ll cnt = 0;
    for(int i=0; i<n; ++i){
      if(mid *b >= an[i]) continue;
      int x = an[i] - mid*b;
      cnt += (x-1) /(a-b) +1;
    }
    if(cnt > mid) l = mid;
    else r = mid;
  }
  cout << r << endl;
}