#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, a, b, k;
  scanf("%d %d %d %d", &n, &a, &b, &k);
  vector<int> h(n);
  for (int i = 0; i < n; i++) scanf("%d", &h[i]);
  for (int i = 0; i < n; i++) h[i] %= (a + b);
  sort(h.begin(), h.end());
  int ans = 0;
  vector<int> needed_k;
  for (int i = 0; i < n; i++) {
    if (h[i] <= a and h[i] > 0)
      ans++;
    else {
      if (h[i] == 0)
        needed_k.push_back((b + a - 1) / a);
      else
        needed_k.push_back((h[i] + a - 1) / a - 1);
    }
  }
  sort(needed_k.begin(), needed_k.end());
  int left = needed_k.size(), i = 0;
  while (i < left) {
    if (k >= needed_k[i]) {
      ans++;
      k -= needed_k[i];
    } else
      break;
    i++;
  }
  printf("%d\n", ans);
}
