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

h=[int(eval(input())) for _ in [0]*n]

f=lambda n:lambda x:x-b*n



def calc(n):

  g=f(n)

  k=lambda x:1+x//(a-b) if x%(a-b) else x//(a-b)

  o=[x for x in map(g,h) if x>0]

  *p,=list(map(k,o))

  if not p:

    return True

  else:

    return sum(p)<=n



l,r=0,max(h)

while r-l>1:

  m=(r+l)//2

  if calc(m):

    r=m

  else:

    l=m

print(r)
from math import ceil



N,A,B=list(map(int,input().split()))

h=[int(eval(input())) for _ in range(N)]



def f(k):

    return sum([ceil((hi-B*k)/(A-B)) for hi in h if hi-k*B>0])<=k



l,r=0,ceil(max(h)/B)



while r-l>1:

    if f((l+r)//2):

        r=(l+r)//2

    else:

        l=(l+r)//2



print(r)
n, a, b = list(map(int, input().split()))
h = [int(eval(input())) for _ in [0] * n]
f = lambda n: lambda x: x - b * n


def calc(n):
    g = f(n)
    k = lambda x: 1 + x // (a - b) if x % (a - b) else x // (a - b)
    o = [x for x in map(g, h) if x > 0]
    (*p,) = list(map(k, o))
    if not p:
        return True
    else:
        return sum(p) <= n


l, r = 0, max(h)
while r - l > 1:
    m = (r + l) // 2
    if calc(m):
        r = m
    else:
        l = m
print(r)

from math import ceil

N, A, B = list(map(int, input().split()))
h = [int(eval(input())) for _ in range(N)]


def f(k):
    return sum([ceil((hi - B * k) / (A - B)) for hi in h if hi - k * B > 0]) <= k


l, r = 0, ceil(max(h) / B)
while r - l > 1:
    if f((l + r) // 2):
        r = (l + r) // 2
    else:
        l = (l + r) // 2
print(r)

-n, a, b = list(map(int, input().split())) -h = [int(eval(input())) for _ in [0] * n] -f = lambda n: lambda x: x - b * n +from math import ceil + +N, A, B = list(map(int, input().split())) +h = [int(eval(input())) for _ in range(N)] -def calc(n): -    g = f(n) -    k = lambda x: 1 + x // (a - b) if x % (a - b) else x // (a - b) -    o = [x for x in map(g, h) if x > 0] -    (*p,) = list(map(k, o)) -    if not p: -        return True -    else: -        return sum(p) <= n +def f(k): +    return sum([ceil((hi - B * k) / (A - B)) for hi in h if hi - k * B > 0]) <= k -l, r = 0, max(h) +l, r = 0, ceil(max(h) / B) -    m = (r + l) // 2 -    if calc(m): -        r = m +    if f((l + r) // 2): +        r = (l + r) // 2 -        l = m +        l = (l + r) // 2