#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;
  sort(topping, topping + n);
  for (int i = n - 1, ans = base / A; i >= 0; i--) {
    base += topping[i];
    if (ans >= base / (A + B * (n - i))) {
      cout << ans;
      break;
    }
    ans = base / (A + B * (n - 1));
  }
}
