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

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

 

import math

def ok(x):

    t = 0

    for i in range(n):

        r = h[i] - b*x

        if r < 0:

            continue

        else:

            t += math.ceil(r/(a-b))

    if t <= x:

        return True

    else:

        return False

 

l = 0

r = 10**14+1

while l+1 < r:

    c = (l+r)//2

    if ok(c):

        r = c

    else:

        l = c

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

H = []

for _ in range(N):

    h = int(eval(input()))

    H.append(h)



ok = 1000000000

ng = 0



while ok != ng+1:

    mid = (ok+ng)//2

    range_damage = mid*B

    attack_count = 0

    for value in H:

        if range_damage < value:

            if (value - range_damage)%(A-B)==0:

                attack_count += (value - range_damage)//(A-B)

            else:

                attack_count += 1+(value - range_damage)//(A-B)



    if attack_count <= mid:

        ok = mid

    else:

        ng = mid

print(ok)
n, a, b = list(map(int, input().split()))
h = [int(eval(input())) for _ in range(n)]
import math


def ok(x):
    t = 0
    for i in range(n):
        r = h[i] - b * x
        if r < 0:
            continue
        else:
            t += math.ceil(r / (a - b))
    if t <= x:
        return True
    else:
        return False


l = 0
r = 10**14 + 1
while l + 1 < r:
    c = (l + r) // 2
    if ok(c):
        r = c
    else:
        l = c
print(r)

N, A, B = list(map(int, input().split()))
H = []
for _ in range(N):
    h = int(eval(input()))
    H.append(h)
ok = 1000000000
ng = 0
while ok != ng + 1:
    mid = (ok + ng) // 2
    range_damage = mid * B
    attack_count = 0
    for value in H:
        if range_damage < value:
            if (value - range_damage) % (A - B) == 0:
                attack_count += (value - range_damage) // (A - B)
            else:
                attack_count += 1 + (value - range_damage) // (A - B)
    if attack_count <= mid:
        ok = mid
    else:
        ng = mid
print(ok)

-n, a, b = list(map(int, input().split())) -h = [int(eval(input())) for _ in range(n)] -import math - - -def ok(x): -    t = 0 -    for i in range(n): -        r = h[i] - b * x -        if r < 0: -            continue -        else: -            t += math.ceil(r / (a - b)) -    if t <= x: -        return True +N, A, B = list(map(int, input().split())) +H = [] +for _ in range(N): +    h = int(eval(input())) +    H.append(h) +ok = 1000000000 +ng = 0 +while ok != ng + 1: +    mid = (ok + ng) // 2 +    range_damage = mid * B +    attack_count = 0 +    for value in H: +        if range_damage < value: +            if (value - range_damage) % (A - B) == 0: +                attack_count += (value - range_damage) // (A - B) +            else: +                attack_count += 1 + (value - range_damage) // (A - B) +    if attack_count <= mid: +        ok = mid -        return False - - -l = 0 -r = 10**14 + 1 -while l + 1 < r: -    c = (l + r) // 2 -    if ok(c): -        r = c -    else: -        l = c -print(r) +        ng = mid +print(ok)