You are going out for a walk, when you suddenly encounter N monsters. Each monster has a parameter called _health_ , and the health of the i-th monster is h_i at the moment of encounter. A monster will vanish immediately when its health drops to 0 or below.  Fortunately, you are a skilled magician, capable of causing explosions that damage monsters. In one explosion, you can damage monsters as follows:    * Select an alive monster, and cause an explosion centered at that monster. The health of the monster at the center of the explosion will decrease by A, and the health of each of the other monsters will decrease by B. Here, A and B are predetermined parameters, and A > B holds.  At least how many explosions do you need to cause in order to vanish all the monsters?
# -*- coding:utf-8 -*-

line = input().split(' ')
N = int(line[0])
A = int(line[1])
B = int(line[2])
hn = sorted([int(input()) for i in range(N)])
# print(hn)
mini = min(hn)
syo = int(mini / A)
if syo == 0:
    syo = 1

hn_s = [i / syo for i in hn]
i = 0
# print(hn_s)
while True:
    hn_s = [i - B for i in hn_s]
    hn_s[-1] -= A - B
    if all([True if i <= 0 else False for i in hn_s]):
        break
    sorted(hn_s)
    i += 1
i -= 1
i *= syo
print(i)

# -*- coding:utf-8 -*-
import math

N, A, B = map(int, input().split(' '))
hn = [int(input()) for i in range(N)]

maxT = max(hn) // B + 1
minT = 0

def enough(T):
    count = sum([math.ceil((h - B*T) / (A-B)) if (h - B*T) >= 0 else 0 for h in hn])
    return True if count <= T else False

while True:
    med = (maxT + minT) // 2
    if enough(med):
        maxT = med
    else:
        minT = med
    if maxT - minT <= 1:
        break
print(maxT)
