object Main extends App {
  val sc = new java.util.Scanner(System.in)
  val n, a, b = sc.nextInt()
  val hs = List.fill(n)(sc.nextLong())
  val c = a - b

  def binSearch(begin: Long, end: Long): Long = {
    def check(x: Long): Boolean = {
      hs.map(h => ((h - (x * b)).max(0) + c - 1) / c).sum <= x
    }

    if (end - begin <= 1) {
      end
    } else {
      val m = begin + (end - begin) / 2
      if (check(m)) binSearch(begin, m) else binSearch(m, end)
    }
  }

  println(binSearch(0, (hs.max + b - 1) / b))
}
