#include <bits/stdc++.h>
using namespace std;
int top[100];
int keisan(int b, long long int karo, int nedan, int limit, int n) {
  if (n == limit) {
    return karo / nedan;
  } else {
    return max(keisan(b, karo + top[n], nedan + b, limit, n + 1),
               keisan(b, karo, nedan, limit, n + 1));
  }
}
int main() {
  int n;
  cin >> n;
  int a, b, c;
  cin >> a >> b;
  cin >> c;
  for (int i = 0; i < n; i++) {
    cin >> top[i];
  }
  cout << keisan(b, c, a, n, 0) << endl;
  return 0;
}
