#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, A, B, C, i, j, k, max, calsum, pricesum;
  int D[10000] = {0};
  cin >> n >> A >> B;
  cin >> C;
  for (i = 0; i < n; i++) cin >> D[i];
  sort(D, D + 10000, greater<int>());
  calsum = C;
  pricesum = A;
  cout << C << " " << A << endl;
  max = calsum / pricesum;
  for (i = 0; i < n; i++) {
    calsum += D[i];
    pricesum += B;
    cout << calsum << " / " << pricesum << " = " << calsum / pricesum << endl;
    ;
    max = (max > calsum / pricesum) ? max : calsum / pricesum;
  }
  cout << max << endl;
  return 0;
}
