import std.stdio, std.conv, std.string;
import std.algorithm, std.array, std.container, std.typecons;
import std.numeric, std.math;
import core.bitop;

T RD(T = long)() { static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }
T[] ARR(T)(in string str, T fix = 0) { auto r = str.split.to!(T[]); r[] += fix; return r; }
size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

bool INSIDE(T)(T x, T b, T e) { return x >= b && x < e; }

long mod = pow(10, 9) + 7;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

struct UnionFind
{
	void init(long n) { par = new long[](n); foreach (i; 0..n) par[i] = i; }
	long root(long i) { return par[i] == i ? i : (par[i] = root(par[i])); }
	bool same(long i, long j) { return root(i) == root(j); }
	void unite(long i, long j) { i = root(i); j = root(j); if (i == j) return; par[i] = j; }
	long[] par;
}

long[] dijkstra(long from, long to, long[][] edges)
{
	long[] path;
	auto cost = new long[](edges.length); fill(cost, long.max); cost[from] = 0;
	long[][] open = [[from]];
	while (!open.empty)
	{
		auto n = open.front; open.popFront;
		auto p = n[0];
		foreach (i; 0..edges.length)
		{
			if (edges[p][i] == -1) continue;
			auto c = cost[p] + edges[p][i];
			if (c < cost[to] && c < cost[i]) { cost[i] = c; if (i == to) path = i ~ n; else open ~= i ~ n; }
		}
	}
	return cost[to] ~ path;
}

void main()
{
	auto N = RD;
	auto A = RD;
	auto B = RD;

	auto h = new long[](N);
	foreach (i; 0..N)
	{
		h[i] = RD;
	}
	h.sort();

	bool test(long cnt)
	{
		long b_sum = B * cnt;
		long a_cnt;
		foreach (i; 0..N)
		{
			if (h[i] <= b_sum) continue;
			long remain = h[i] - b_sum;
			long diff   = A - B;
			long need_a = remain / diff + (remain % diff != 0 ? 1 : 0);
			a_cnt += need_a;
			if (a_cnt > cnt) return false;
		}
		return true;
	}

	long max_cnt = h[$-1] / B + (h[$-1] % B != 0 ? 1 : 0);
	long mid_cnt = max_cnt / 2;
	long band    = max(1, mid_cnt);
	long ans;
	bool end;
	while (true)
	{
		stderr.writeln(mid_cnt);
		if (band == 0) end = true;
		if (test(mid_cnt))
		{
			ans = mid_cnt;
			mid_cnt -= max(1, band);
		}
		else
		{
			mid_cnt += max(1, band);
		}
		band = band == 1 ? 0 : (band + 1) / 2;

		if (end) break;
	}

	writeln(ans);
	stdout.flush();
}