
import java.util.Scanner

object Main extends App {
  val sc = new Scanner(System.in)

  val n, a, b = sc.nextInt()
  val ar = Range(0, n).map(_ => sc.nextLong()).sorted.toArray

  println(solve)

  def solve(): Long = {
    var l = 1L
    var r = 1000L * 1000L * 1000L
    while (l < r - 1) {
      val c = (l + r) / 2
      if (ok(c)) r = c
      else l = c + 1
    }
    return l
  }

  def ok(cnt: Long): Boolean = {
    ar.foldLeft(0L) {
      case (sum, h) => {
        if (cnt * b > h) {
          sum
        } else {
          sum + ((h - cnt * b - 1) / (a - b)) + 1
        }
      }
    } <= cnt
  }
}
