#include <bits/stdc++.h>
using namespace std;
int main() {
  deque<int> nums;
  int N, A, B, C, D[100];
  cin >> N >> A >> B >> C;
  for (int i = 0; i < N; i++) {
    cin >> D[i];
    nums.push_back(D[i]);
  }
  sort(nums.begin(), nums.end());
  deque<int>::iterator it = nums.begin();
  int l = 0;
  while (it != nums.end()) {
    D[l] = *it;
    ++it;
    l++;
  }
  int nPc, nPri;
  nPc = C;
  nPri = A;
  cout << nPc / nPri << endl;
  for (int i = 0; i < N; i++) {
    if (1.0 * nPc / nPri <= 1.0 * (nPc + D[i]) / (nPri + B)) {
      nPc += D[i];
      nPri += B;
    }
  }
  cout << nPc / nPri << endl;
  return 0;
}
