#include <bits/stdc++.h>
int rec(int, int, int);
using namespace std;
int n;
int k_n;
int k_prise, t_prise;
vector<int> topi;
int main() {
  cin >> n;
  cin >> k_prise >> t_prise;
  cin >> k_n;
  for (int i = 0; i < n; i++) {
    int tmp;
    cin >> tmp;
    topi.push_back(tmp);
  }
  int ans = rec(0, k_n, k_prise);
  cout << ans << endl;
  return 0;
}
int rec(int i, int cal, int prise) {
  if (i == n) {
    return cal / prise;
  } else {
    return max(rec(i + 1, cal, prise),
               rec(i + 1, cal + topi[i + 1], prise + t_prise));
  }
}
