import std.algorithm;
import std.array;
import std.container;
import std.conv;
import std.math;
import std.numeric;
import std.range;
import std.stdio;
import std.string;
import std.typecons;

long calc(long a, long b, long[] h) {
    // m 回で全ての魔物を倒せるか
    bool check(long m) {
        long k = 0;
        foreach (e; h) {
            long x = e - b * m; // m 回分の b ダメージ
            if (x > 0) {
                // a ダメージを何回与えると倒せるか
                k += (x + (a - b) - 1) / (a - b);
            }
        }
        return m >= k;
    }

    long lo = 1;
    long hi = int.max;
    long ans = hi;
    while (lo <= hi) {
        long m = (lo + hi) / 2;
        if (check(m)) {
            ans = min(ans, m);
            hi = m - 1;
        } else lo = m + 1;
    }
    return ans;
}

void main() {
    int n, a, b; scan(n, a, b);
    long[] h;
    foreach (_; 0..n) h ~= read!long;
    writeln(calc(a, b, h));
}

void scan(T...)(ref T a) {
    string[] ss = readln.split;
    foreach (i, t; T) a[i] = ss[i].to!t;
}
T read(T)() { return readln.chomp.to!T; }
T[] reads(T)() { return readln.split.to!(T[]); }
alias readint = read!int;
alias readints = reads!int;
