import std.algorithm, std.container, std.conv, std.math, std.range, std.typecons, std.stdio, std.string;

auto rdsp(){return readln.splitter;}
void pick(R,T)(ref R r,ref T t){t=r.front.to!T;r.popFront;}
void readV(T...)(ref T t){auto r=rdsp;foreach(ref v;t)pick(r,v);}
void readC(T...)(size_t n,ref T t){foreach(ref v;t)v=new typeof(v)(n);foreach(i;0..n){auto r=rdsp;foreach(ref v;t)pick(r,v[i]);}}

void main()
{
  int n, a, b; readV(n, a, b);
  int[] h; readC(n, h);

  auto calc(int x)
  {
    auto t = h.dup;
    t[] -= b*x;
    auto y = t.filter!"a>0".map!(ti => (ti+a-b-1)/(a-b).to!long).sum;
    return y <= x;
  }

  auto bs = iota(1, (h.reduce!max+b-1)/b+1).map!(x => tuple(x, calc(x))).assumeSorted!"a[1] < b[1]";
  writeln(bs.upperBound(tuple(0, false)).front[0]);
}
