import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv,
    std.functional, std.math, std.numeric, std.range, std.stdio, std.string,
    std.random, std.typecons, std.container;

ulong MAX = 100_100, MOD = 1_000_000_007, INF = 1_000_000_000_000;
alias sread = () => readln.chomp();
alias lread(T = long) = () => readln.chomp.to!(T);
alias aryread(T = long) = () => readln.split.to!(T[]);
alias Pair = Tuple!(long, "a", long, "b");
alias PQueue(T, alias less = "a>b") = BinaryHeap!(Array!T, less);

void main()
{
    long n, a, b;
    scan(n, a, b);
    auto h = new long[](n);
    foreach (i; iota(n))
        h[i] = lread();

    long ok = (h.reduce!(max) + b - 1) / b, ng = -1;
    while (abs(ok - ng) > 1)
    {
        long mid = (ok + ng) / 2;
        bool solve()
        {
            long cnt;
            foreach (e; h)
            {
                if (e - mid * b > 0)
                {
                    cnt += ((e - mid * b) + (a - b) - 1) / (a - b);
                }
            }
            return (cnt <= mid);
        }

        if (solve())
            ok = mid;
        else
            ng = mid;
    }
    writeln(ok);
}

void scan(TList...)(ref TList Args)
{
    auto line = readln.split();
    foreach (i, T; TList)
    {
        T val = line[i].to!(T);
        Args[i] = val;
    }
}
