import math

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

H = [0] * N

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

maxH = max(H)

U = math.ceil(maxH / B)

L = 0

def binsearch(U, L):

  m = (U + L) // 2

  if m == L:

    print(U)

  else:

    if sum([math.ceil(max(h - B * m, 0) / (A - B)) for h in H]) <= m:

      binsearch(m, L)

    else:

      binsearch(U, m)

binsearch(U, L)
import math

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

H = [0] * N

maxh = 0

for i in range(N):

  h = int(eval(input()))

  H[i] = h

  maxh = max(h, maxh)

lower = 0

upper = math.ceil(maxh / B)

def search(upper, lower):

  if lower + 1 == upper:

    return upper

  else:

    mid = (upper + lower) // 2

    _H = [h - mid * B for h in H]

    cnt = 0

    for h in _H:

      if h > 0:

        cnt += math.ceil(h / (A - B))

    if cnt <= mid:

      return search(mid, lower)

    else:

      return search(upper, mid)

print((search(upper, lower)))
import math

N, A, B = list(map(int, input().split()))
H = [0] * N
H = [int(eval(input())) for i in range(N)]
maxH = max(H)
U = math.ceil(maxH / B)
L = 0


def binsearch(U, L):
    m = (U + L) // 2
    if m == L:
        print(U)
    else:
        if sum([math.ceil(max(h - B * m, 0) / (A - B)) for h in H]) <= m:
            binsearch(m, L)
        else:
            binsearch(U, m)


binsearch(U, L)

import math

N, A, B = list(map(int, input().split()))
H = [0] * N
maxh = 0
for i in range(N):
    h = int(eval(input()))
    H[i] = h
    maxh = max(h, maxh)
lower = 0
upper = math.ceil(maxh / B)


def search(upper, lower):
    if lower + 1 == upper:
        return upper
    else:
        mid = (upper + lower) // 2
        _H = [h - mid * B for h in H]
        cnt = 0
        for h in _H:
            if h > 0:
                cnt += math.ceil(h / (A - B))
        if cnt <= mid:
            return search(mid, lower)
        else:
            return search(upper, mid)


print((search(upper, lower)))

-H = [int(eval(input())) for i in range(N)] -maxH = max(H) -U = math.ceil(maxH / B) -L = 0 +maxh = 0 +for i in range(N): +    h = int(eval(input())) +    H[i] = h +    maxh = max(h, maxh) +lower = 0 +upper = math.ceil(maxh / B) -def binsearch(U, L): -    m = (U + L) // 2 -    if m == L: -        print(U) +def search(upper, lower): +    if lower + 1 == upper: +        return upper -        if sum([math.ceil(max(h - B * m, 0) / (A - B)) for h in H]) <= m: -            binsearch(m, L) +        mid = (upper + lower) // 2 +        _H = [h - mid * B for h in H] +        cnt = 0 +        for h in _H: +            if h > 0: +                cnt += math.ceil(h / (A - B)) +        if cnt <= mid: +            return search(mid, lower) -            binsearch(U, m) +            return search(upper, mid) -binsearch(U, L) +print((search(upper, lower)))