import math



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

H = [int(eval(input())) for i in range(N)]



add_damage = A-B

left = 1

right = 10**9

ans = float('inf')



for i in range(int(math.log(10**9, 2)+1)):

    T = (left+right) // 2

    h = H.copy()

    h = list([math.ceil(max(0, x-T*B) / add_damage) for x in h])

    need = sum(h)

    

    if need <= T:

        right = T

        ans = min(ans, T)

    else:

        left = T



print(ans)
from math import ceil

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

H = sorted([int(eval(input())) for i in range(N)])

C = A - B



lo, hi = -1, 10**9

while hi - lo > 1:

    X = (hi + lo) // 2

    H2 = [max(0, h - (X * B)) for h in H]

    need = sum([ceil(h / C) for h in H2])

    if need > X:

        lo = X

    else:

        hi = X



print(hi)

import math

N, A, B = list(map(int, input().split()))
H = [int(eval(input())) for i in range(N)]
add_damage = A - B
left = 1
right = 10**9
ans = float("inf")
for i in range(int(math.log(10**9, 2) + 1)):
    T = (left + right) // 2
    h = H.copy()
    h = list([math.ceil(max(0, x - T * B) / add_damage) for x in h])
    need = sum(h)
    if need <= T:
        right = T
        ans = min(ans, T)
    else:
        left = T
print(ans)

from math import ceil

N, A, B = list(map(int, input().split()))
H = sorted([int(eval(input())) for i in range(N)])
C = A - B
lo, hi = -1, 10**9
while hi - lo > 1:
    X = (hi + lo) // 2
    H2 = [max(0, h - (X * B)) for h in H]
    need = sum([ceil(h / C) for h in H2])
    if need > X:
        lo = X
    else:
        hi = X
print(hi)

-import math +from math import ceil -H = [int(eval(input())) for i in range(N)] -add_damage = A - B -left = 1 -right = 10**9 -ans = float("inf") -for i in range(int(math.log(10**9, 2) + 1)): -    T = (left + right) // 2 -    h = H.copy() -    h = list([math.ceil(max(0, x - T * B) / add_damage) for x in h]) -    need = sum(h) -    if need <= T: -        right = T -        ans = min(ans, T) +H = sorted([int(eval(input())) for i in range(N)]) +C = A - B +lo, hi = -1, 10**9 +while hi - lo > 1: +    X = (hi + lo) // 2 +    H2 = [max(0, h - (X * B)) for h in H] +    need = sum([ceil(h / C) for h in H2]) +    if need > X: +        lo = X -        left = T -print(ans) +        hi = X +print(hi)