#include <bits/stdc++.h>
using namespace std;
int n, a, b, k, ans, h[200005], now, w[200005];
int work(int x, int y) {
  if (x % y == 0) return x / y;
  return x / y + 1;
}
int main() {
  scanf("%d%d%d%d", &n, &a, &b, &k);
  now = 0;
  for (register int i = 1; i <= n; ++i) scanf("%d", &h[i]);
  for (register int i = 1; i <= n; ++i) {
    h[i] %= (a + b);
    if (h[i] == 0) h[i] = a + b;
    if (a >= h[i]) {
      ++ans;
      continue;
    }
    h[i] -= a;
    w[i] = work(h[i], a);
  }
  sort(w + 1, w + 1 + n);
  for (register int i = 1; i <= n; ++i) {
    if (k >= w[i] && w[i] != 0) {
      k -= w[i];
      ++ans;
    }
  }
  printf("%d\n", ans);
  return 0;
}
