#include <bits/stdc++.h>

#define F first
#define S second

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;

const int N = 100010, M = 110;

int n;
LL A, B;
LL a[N];

bool check(LL x)
{
	LL cnt = 0;
	for (int i = 1; i <= n; i ++ ) cnt += max(0LL, (a[i] - x * B + A - B - 1) / (A - B));
	return cnt <= x;
}

int main()
{
	scanf("%d%lld%lld", &n, &A, &B);
	for (int i = 1; i <= n; i ++ ) scanf("%lld", a + i);
	
	LL l = 0, r = 1e9;
	while (l < r)
	{
		int mid = l + r >> 1;
		if (check(mid)) r = mid;
		else l = mid + 1;
	}
	
	printf("%lld\n", r);
	return 0;
}