#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 9;
int h[N];
int main() {
  int n, a, b, k;
  scanf("%d %d %d %d", &n, &a, &b, &k);
  int ans = 0;
  for (int i = 1; i <= n; ++i) {
    scanf("%d", h + i);
    h[i] %= (a + b);
    if (h[i] == 0) h[i] = a + b;
  }
  priority_queue<int, vector<int>, greater<int> > q;
  for (int i = 1; i <= n; ++i) {
    if (h[i] <= a)
      ++ans;
    else {
      h[i] -= a;
      int tem = h[i] / a;
      if (h[i] % a) ++tem;
      q.push(tem);
    }
  }
  while ((!q.empty()) && k >= q.top()) {
    k -= q.top();
    q.pop();
    ++ans;
  }
  printf("%d", ans);
  return 0;
}
