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

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

maxn = (max(hlist) + b - 1) // b



def enough(t):

  c = 0

  for h in hlist:

    if h - b * t > 0:

      c += (h - b * t + a - b - 1) // (a - b)

  return c <= t



l, r = 0, maxn

while l != r:

  mid = (l + r) // 2

  if enough(mid):

    r = mid

  else:

    l = mid + 1

print(l)

def main():

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

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

    low, high = 0, 1000000000000000000

    while low < high:

        mid = (low + high) // 2

        tmp = 0

        for _h in h:

            if _h > mid * b:

                tmp += (_h - mid * b + a - b - 1) // (a - b)

        if tmp > mid:

            low = mid + 1

        else:

            high = mid

    print(low)





if __name__ == '__main__':

    main()

n, a, b = list(map(int, input().split()))
hlist = [int(eval(input())) for _ in range(n)]
maxn = (max(hlist) + b - 1) // b


def enough(t):
    c = 0
    for h in hlist:
        if h - b * t > 0:
            c += (h - b * t + a - b - 1) // (a - b)
    return c <= t


l, r = 0, maxn
while l != r:
    mid = (l + r) // 2
    if enough(mid):
        r = mid
    else:
        l = mid + 1
print(l)

def main():
    n, a, b = list(map(int, input().split()))
    h = [int(eval(input())) for _ in range(n)]
    low, high = 0, 1000000000000000000
    while low < high:
        mid = (low + high) // 2
        tmp = 0
        for _h in h:
            if _h > mid * b:
                tmp += (_h - mid * b + a - b - 1) // (a - b)
        if tmp > mid:
            low = mid + 1
        else:
            high = mid
    print(low)


if __name__ == "__main__":
    main()

-n, a, b = list(map(int, input().split())) -hlist = [int(eval(input())) for _ in range(n)] -maxn = (max(hlist) + b - 1) // b +def main(): +    n, a, b = list(map(int, input().split())) +    h = [int(eval(input())) for _ in range(n)] +    low, high = 0, 1000000000000000000 +    while low < high: +        mid = (low + high) // 2 +        tmp = 0 +        for _h in h: +            if _h > mid * b: +                tmp += (_h - mid * b + a - b - 1) // (a - b) +        if tmp > mid: +            low = mid + 1 +        else: +            high = mid +    print(low) -def enough(t): -    c = 0 -    for h in hlist: -        if h - b * t > 0: -            c += (h - b * t + a - b - 1) // (a - b) -    return c <= t - - -l, r = 0, maxn -while l != r: -    mid = (l + r) // 2 -    if enough(mid): -        r = mid -    else: -        l = mid + 1 -print(l) +if __name__ == "__main__": +    main()