n,a,b,*h=list(map(int,open(0).read().split()))

i,j=0,2**30

while~i+j:

 k=c=(j+i)//2

 for t in h:c+=min(0,(b*k-t)//(a-b))

 if c<0:i=k

 else:j=k

print(j)
from numpy import*

t,*h=open(0)

_,a,b=int32(t.split())

i,j=0,2**30

while~i+j:

 k=(j+i)//2;t=(b*k-int32(h))//(a-b)

 if-k>sum(t[t<0]):i=k

 else:j=k

print(j)
n, a, b, *h = list(map(int, open(0).read().split()))
i, j = 0, 2**30
while ~i + j:
    k = c = (j + i) // 2
    for t in h:
        c += min(0, (b * k - t) // (a - b))
    if c < 0:
        i = k
    else:
        j = k
print(j)

from numpy import *

t, *h = open(0)
_, a, b = int32(t.split())
i, j = 0, 2**30
while ~i + j:
    k = (j + i) // 2
    t = (b * k - int32(h)) // (a - b)
    if -k > sum(t[t < 0]):
        i = k
    else:
        j = k
print(j)

-n, a, b, *h = list(map(int, open(0).read().split())) +from numpy import * + +t, *h = open(0) +_, a, b = int32(t.split()) -    k = c = (j + i) // 2 -    for t in h: -        c += min(0, (b * k - t) // (a - b)) -    if c < 0: +    k = (j + i) // 2 +    t = (b * k - int32(h)) // (a - b) +    if -k > sum(t[t < 0]):