import math        

    

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

arr=[]



for i in range(N):

    arr.append(int(eval(input())))



max_=max(arr)//B+1

min_=min(arr)//A



d=A-B



while min_!=max_:

    mid=(max_+min_)//2

    

    sum_=0

    for x in arr:

        y=(x-mid*B)

        if y<=0:

            continue

        sum_+=math.ceil(y/d)

        

    if sum_<=mid:

        max_=mid

    else:

        min_=mid+1



print(min_)
import math



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

arr=[]

h_sum=0

for i in range(N):

    h=int(eval(input()))

    arr.append(h)

    h_sum+=h



max_=max(arr)//B+1

min_=h_sum//(A+B*(N-1))



d=A-B



while min_!=max_:

    mid=(max_+min_)//2

    

    sum_=0

    for x in arr:

        y=(x-mid*B)

        if y<=0:

            continue

        sum_+=math.ceil(y/d)

        

    if sum_<=mid:

        max_=mid

    else:

        min_=mid+1



print(min_)
import math

N, A, B = list(map(int, input().split()))
arr = []
for i in range(N):
    arr.append(int(eval(input())))
max_ = max(arr) // B + 1
min_ = min(arr) // A
d = A - B
while min_ != max_:
    mid = (max_ + min_) // 2
    sum_ = 0
    for x in arr:
        y = x - mid * B
        if y <= 0:
            continue
        sum_ += math.ceil(y / d)
    if sum_ <= mid:
        max_ = mid
    else:
        min_ = mid + 1
print(min_)

import math

N, A, B = list(map(int, input().split()))
arr = []
h_sum = 0
for i in range(N):
    h = int(eval(input()))
    arr.append(h)
    h_sum += h
max_ = max(arr) // B + 1
min_ = h_sum // (A + B * (N - 1))
d = A - B
while min_ != max_:
    mid = (max_ + min_) // 2
    sum_ = 0
    for x in arr:
        y = x - mid * B
        if y <= 0:
            continue
        sum_ += math.ceil(y / d)
    if sum_ <= mid:
        max_ = mid
    else:
        min_ = mid + 1
print(min_)

+h_sum = 0 -    arr.append(int(eval(input()))) +    h = int(eval(input())) +    arr.append(h) +    h_sum += h -min_ = min(arr) // A +min_ = h_sum // (A + B * (N - 1))