#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, A, B;
  cin >> n >> A >> B;
  int topping[100];
  for (int i = 0; i < n; i++) cin >> topping[i];
  int base;
  cin >> base;
  int ans = base / A;
  sort(topping, topping + n);
  for (int i = n - 1; i >= 0; i--)
    ans = max(ans, (base += topping[i]) / (A + B * (n - i)));
  cout << ans << endl;
}
