from math import ceil

def f(x,hp):

  hp=[hh-(b*x) for hh in hp]

  c=0

  for p in hp:

    if p<=0:continue

    c+=ceil(p/(a-b))

  return c<=x



n,a,b=list(map(int,input().split()))

h=[int(eval(input())) for i in range(n)]

ng=0

ok=10**9

while ok-ng>1:

  mid=(ok+ng)//2

  if f(mid,h):

    ok=mid

  else:

    ng=mid

print(ok)









from math import ceil



def f(x,h):

    hp = h

    hp = [hh-(b*x)  for hh in hp]

    count = 0

    for hh in hp:

        if hh <=0: continue

        count += ceil(hh/(a-b))

    return x >= count



n,a,b = list(map(int,input().split()))

h = [int(eval(input())) for i in range(n)]



ng = 0

ok = 10**9

while abs(ok-ng)>1:

    m = (ok+ng)//2

    if f(m,h):

        ok = m

    else:

        ng = m



print(ok)
from math import ceil


def f(x, hp):
    hp = [hh - (b * x) for hh in hp]
    c = 0
    for p in hp:
        if p <= 0:
            continue
        c += ceil(p / (a - b))
    return c <= x


n, a, b = list(map(int, input().split()))
h = [int(eval(input())) for i in range(n)]
ng = 0
ok = 10**9
while ok - ng > 1:
    mid = (ok + ng) // 2
    if f(mid, h):
        ok = mid
    else:
        ng = mid
print(ok)

from math import ceil


def f(x, h):
    hp = h
    hp = [hh - (b * x) for hh in hp]
    count = 0
    for hh in hp:
        if hh <= 0:
            continue
        count += ceil(hh / (a - b))
    return x >= count


n, a, b = list(map(int, input().split()))
h = [int(eval(input())) for i in range(n)]
ng = 0
ok = 10**9
while abs(ok - ng) > 1:
    m = (ok + ng) // 2
    if f(m, h):
        ok = m
    else:
        ng = m
print(ok)

-def f(x, hp): +def f(x, h): +    hp = h -    c = 0 -    for p in hp: -        if p <= 0: +    count = 0 +    for hh in hp: +        if hh <= 0: -        c += ceil(p / (a - b)) -    return c <= x +        count += ceil(hh / (a - b)) +    return x >= count -while ok - ng > 1: -    mid = (ok + ng) // 2 -    if f(mid, h): -        ok = mid +while abs(ok - ng) > 1: +    m = (ok + ng) // 2 +    if f(m, h): +        ok = m -        ng = mid +        ng = m