#include <iostream>
#include <algorithm>
#include <functional>

using namespace std;
int n, p1, p2, res, cl;
int tcl[101];

int main()
{
  while(cin>>n && n){
    cin >> p1 >> p2 >> cl;
    for(int i = 0; i < n; ++i) cin >> tcl[i];
    res = cl/p1;
    sort(tcl, tcl+n, greater<int>());

    for(int i = 0; i < n; ++i){
      cl += tcl[i];
      p1 += p2;
      if(res > cl/p1) break;
      res = cl/p1;
    }

    cout << res << endl;
  }

  return 0;
}