#include <bits/stdc++.h>
using namespace std;
int n, m, o, a[500005];

bool check(int k) {
	int sum = 0;
	for (int i = 0; i < n; i++) {
		int num = a[i] - m * k;
		if (num > 0)
			sum += num / o + (num % o != 0);
	}
	return sum <= k;
}

int Find() {
	int l = 1, r = 5000005;
	while (l + 1 < r) {
		int mid = (l + r + 1) / 2;
		if (check(mid))
			l = mid;
		else
			r = mid - 1;
	}
	return l;
}

int main() {
	cin >> n >> m >> o;
	for (int i = 0; i < n; i++)
		cin >> a[i];
	cout << Find();
}

求调