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

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

h.sort()



def check(k):

    top = 0

    tmp = h[::]

    for i in range(n):

        amari = tmp[i] - b*k

        if amari > 0:

            top += -(-amari//(a-b))

    return top <= k



# 二分探索

left = 0

right = -(-1*sum(h)//b)

while(right-left>1):

    next_ind = (left + right)//2

    if check(next_ind):

        right = next_ind

    else:

        left = next_ind

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

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



def check(k):

    cnt = 0

    for i in h:

        hp = i - k*b

        if hp > 0:

            cnt += -(-hp//(a-b))

    return cnt <= k



left = 0

right = 10**10

while right - left>1:

    mid = (right + left)//2

    if check(mid):

        right = mid

    else:

        left = mid

print(right)

n, a, b = list(map(int, input().split()))
h = [int(eval(input())) for i in range(n)]
h.sort()


def check(k):
    top = 0
    tmp = h[::]
    for i in range(n):
        amari = tmp[i] - b * k
        if amari > 0:
            top += -(-amari // (a - b))
    return top <= k


# 二分探索
left = 0
right = -(-1 * sum(h) // b)
while right - left > 1:
    next_ind = (left + right) // 2
    if check(next_ind):
        right = next_ind
    else:
        left = next_ind
print(right)

n, a, b = list(map(int, input().split()))
h = [int(eval(input())) for i in range(n)]


def check(k):
    cnt = 0
    for i in h:
        hp = i - k * b
        if hp > 0:
            cnt += -(-hp // (a - b))
    return cnt <= k


left = 0
right = 10**10
while right - left > 1:
    mid = (right + left) // 2
    if check(mid):
        right = mid
    else:
        left = mid
print(right)

-h.sort() -    top = 0 -    tmp = h[::] -    for i in range(n): -        amari = tmp[i] - b * k -        if amari > 0: -            top += -(-amari // (a - b)) -    return top <= k +    cnt = 0 +    for i in h: +        hp = i - k * b +        if hp > 0: +            cnt += -(-hp // (a - b)) +    return cnt <= k -# 二分探索 -right = -(-1 * sum(h) // b) +right = 10**10 -    next_ind = (left + right) // 2 -    if check(next_ind): -        right = next_ind +    mid = (right + left) // 2 +    if check(mid): +        right = mid -        left = next_ind +        left = mid