n,a,b,*h=list(map(int,open(0).read().split()));i,j=0,-(-max(h)*n//a)

while j-i>1:

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

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

 if c>=0:j=k

 else:i=k

print(j)
n,a,b,*h=list(map(int,open(0).read().split()));i,j=0,-(-max(h)*n//a)

while j-i>1:

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

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

 if c>=0:j=k

 else:i=k

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

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

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