import math

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

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

Hs = sum(H)

c = A - B

M = math.ceil(Hs / B)



m = 0



while M - m > 1:

	n = (M + m) // 2

	H2 = [H[i] - n * B for i in range(N) if H[i] - n * B > 0]

	cnts = [math.ceil(H2[i] / c) for i in range(len(H2))]

	cnt = sum(cnts)

	if cnt > n:

		m = n

	elif cnt == n:

		M = n

		break

	else:

		M = n

print(M)
import math

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

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

Hs = sum(H)

c = A - B

M = math.ceil(max(H) / B)



m = max(H) // A



while M - m > 1:

	n = (M + m) // 2

	H2 = [math.ceil((H[i] - n * B) / c) for i in range(N) if H[i] - n * B > 0]

	cnt = sum(H2)

	if cnt > n:

		m = n

	elif cnt == n:

		M = n

		break

	else:

		M = n

print(M)
import math

N, A, B = list(map(int, input().split()))
H = [int(eval(input())) for i in range(N)]
Hs = sum(H)
c = A - B
M = math.ceil(Hs / B)
m = 0
while M - m > 1:
    n = (M + m) // 2
    H2 = [H[i] - n * B for i in range(N) if H[i] - n * B > 0]
    cnts = [math.ceil(H2[i] / c) for i in range(len(H2))]
    cnt = sum(cnts)
    if cnt > n:
        m = n
    elif cnt == n:
        M = n
        break
    else:
        M = n
print(M)

import math

N, A, B = list(map(int, input().split()))
H = [int(eval(input())) for i in range(N)]
Hs = sum(H)
c = A - B
M = math.ceil(max(H) / B)
m = max(H) // A
while M - m > 1:
    n = (M + m) // 2
    H2 = [math.ceil((H[i] - n * B) / c) for i in range(N) if H[i] - n * B > 0]
    cnt = sum(H2)
    if cnt > n:
        m = n
    elif cnt == n:
        M = n
        break
    else:
        M = n
print(M)

-M = math.ceil(Hs / B) -m = 0 +M = math.ceil(max(H) / B) +m = max(H) // A -    H2 = [H[i] - n * B for i in range(N) if H[i] - n * B > 0] -    cnts = [math.ceil(H2[i] / c) for i in range(len(H2))] -    cnt = sum(cnts) +    H2 = [math.ceil((H[i] - n * B) / c) for i in range(N) if H[i] - n * B > 0] +    cnt = sum(H2)