#include <bits/stdc++.h>
using namespace std;
int main() {
  int N, A, B;
  int x;
  cin >> N >> A >> B >> x;
  int y[N];
  for (int i = 0; i < N; i++) {
    cin >> y[i];
  }
  sort(y, y + N);
  reverse(y, y + N);
  cout << y[0] << endl;
  int buf;
  int max = x / A;
  int S[N];
  S[0] = y[0];
  for (int i = 1; i < N; i++) {
    S[i] = S[i - 1] + y[i];
  }
  for (int i = 0; i < N; i++) {
    buf = (x + S[i]) / (A + (i + 1) * B);
    if (buf >= max) {
      max = buf;
    }
  }
  cout << max << endl;
}
