#include <bits/stdc++.h>
inline long long read() {
  long long x = 0, y = 1;
  char c = std::getchar();
  while (c < '0' || c > '9') {
    if (c == '-') y = 0;
    c = std::getchar();
  }
  while (c >= '0' && c <= '9') {
    x = x * 10 + (c ^ 48);
    c = std::getchar();
  }
  return y ? x : -x;
}
int n;
int ans;
long long a, b, k;
long long f[200006];
int cnt;
inline int cmp(long long x, long long y) { return x < y; }
int main() {
  n = read();
  a = read();
  b = read();
  k = read();
  for (register int i = 1; i <= n; i++) {
    long long hi = read();
    long long left = hi % (a + b);
    if (left == 0) left = a + b;
    if (left <= a) {
      ans++;
      continue;
    }
    f[++cnt] = std::ceil((double)(left - a) / a);
  }
  std::sort(f + 1, f + 1 + cnt, cmp);
  for (register int i = 1; i <= cnt; i++) {
    if (k < f[i]) break;
    k -= f[i];
    ans++;
  }
  std::printf("%d", ans);
  return 0;
}
