import std.stdio, std.string, std.conv, std.range, std.array, std.algorithm;
import std.uni, std.math, std.container, std.typecons, std.typetuple;
import core.bitop, std.datetime;

immutable int mod = 10^^9 + 7;

void main()
{
    int n, a, b;
    readVars(n, a, b);

    auto h = new int[](n);
    foreach(i ; 0 .. n) readVars(h[i]);

    int top, btm, mid;
    top = (h.reduce!max + b - 1) / b;
    btm = 0;

    int dif = a - b;

    auto check = (int k) {
        int cnt;

        foreach (hi ; h) {
            if (hi > k * b) {
                cnt += (hi - k*b + dif - 1) / dif;

                if (cnt > k) {
                    return false;
                }
            }
        }

        return true;
    };

    while (top - btm > 1) {
        mid = btm + (top - btm) / 2;

        if (check(mid)) {
            top = mid;
        }
        else {
            btm = mid;
        }
    }

    writeln(top);
}

void readVars(T...)(auto ref T args)
{
    auto line = readln.split;
    foreach(ref arg ; args){
        arg = line.front.to!(typeof(arg));
        line.popFront;
    }
    if(!line.empty){
        writeln(line);
        throw new Exception("args num < input num");
    }
}