#include <bits/stdc++.h>
#pragma gcc optimize("ofast")
using namespace std;
long long modexp(long long a, long long b, long long m) {
  long long r = 1;
  a = a % m;
  while (b > 0) {
    if (b & 1) r = (r * a) % m;
    b = b / 2;
    a = (a * a) % m;
  }
  return r % m;
}
int main() {
  ios_base::sync_with_stdio(0);
  long long n, a, b, k;
  cin >> n >> a >> b >> k;
  vector<long long> h(n);
  for (int i = 0; i < n; i++) cin >> h[i];
  vector<long long> ind;
  ind.clear();
  long long points = 0;
  for (int i = 0; i < n; i++) {
    long long left = h[i] % (a + b);
    if (left > a || left == 0) {
      ind.push_back(i);
    } else
      points++;
  }
  long long len = ind.size();
  for (int i = 0; i < len; i++) {
    long long left = h[ind[i]] % (a + b);
    if (left == 0) left = a + b;
    left -= a;
    ind[i] = left;
  }
  sort(ind.begin(), ind.end());
  long long pointstogive = k * a;
  for (int i = 0; i < len; i++) {
    if (pointstogive <= 0)
      break;
    else {
      if (ind[i] <= pointstogive) {
        long long g = ceil((double)ind[i] / (double)a);
        points++;
        pointstogive -= g * a;
      } else {
        break;
      }
    }
  }
  cout << points << '\n';
  return 0;
}
