output_description: Print the minimum number of explosions that needs to be caused in order to
  vanish all the monsters.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N A B
      h_1
      h_2
      :
      h_N
attempt: # -*- coding: utf-8 -*-
  """
  http://abc063.contest.atcoder.jp/tasks/arc075_b
  TLE
  """
  import sys
  from sys import stdin
  from math import ceil
  
  input = stdin.readline
  
  
  def Cond(monsters, A, B, mid):
      t = [x - (B * mid) for x in monsters]
      t.sort(reverse=True)
      additional_damage = A - B
  
      total_count = 0
      for m in t:
          if m < 1:
              break
          total_count += ceil(m / additional_damage)
  
      if total_count <= mid:
          return True
      else:
          return False
  
  
  def main(args):
      # N = 2
      # A = 10
      # B = 4
      # monsters = [20, 20]
      N, A, B = map(int, input().split())
      monsters = [int(input()) for _ in range(N)]
  
      total_count = 0
      if N == 1:
          total_count = ceil(monsters[0] / A)
      else:
          monsters.sort(reverse=True)
          lb = ceil(monsters[0] / A)
          ub = ceil(monsters[0] / B)
          # lb = 0
          # ub = 1e10
  
          for _ in range(30):
              mid = (lb + ub) // 2
              if Cond(monsters, A, B, mid):
                  ub = mid
              else:
                  lb = mid
          total_count = int(ub)
  
      print(total_count)
  
  
  if __name__ == "__main__":
      main(sys.argv[1:])
  
problem_description: Statement
  
  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?
samples: [{"input": "4 5 3\n    8\n    7\n    4\n    2", "output": "2\n    \n\nYou can vanish all the monsters in two explosion, as follows:\n\n  * First, cause an explosion centered at the monster with 8 health. The healths of the four monsters become 3, 4, 1 and -1, respectively, and the last monster vanishes.\n  * Second, cause an explosion centered at the monster with 4 health remaining. The healths of the three remaining monsters become 0, -1 and -2, respectively, and all the monsters are now vanished.\n\n* * *"}, {"input": "2 10 4\n    20\n    20", "output": "4\n    \n\nYou need to cause two explosions centered at each monster, for a total of\nfour.\n\n* * *"}, {"input": "5 2 1\n    900000000\n    900000000\n    1000000000\n    1000000000\n    1000000000", "output": "800000000"}]