#include <iostream>
using namespace std;
typedef long long ll;

int main() {
  int n, a, b; cin >> n >> a >> b;
  int h[n];
  for (int i = 0; i < n; i++) cin >> h[i];
  
  int maxh = 0;
  for (int i = 0; i < n; i++) maxh = max(maxh, h[i]);

  int l = 1, r = (maxh + b - 1) / b;
  while (l < r) {
    int c = (l + r) / 2;
    ll count = 0;
    for (int i = 0; i < n; i++) {
      int rest = max(0LL, h[i] - b * (ll)c);
      count += (rest + (a - b) - 1) / (a - b);
    }
    if (count > c)
      l = c + 1;
    else
      r = c;
  }
  cout << l << endl;
}