#include <bits/stdc++.h>
using namespace std;
int n, a, b, k;
int h[200005];
void solve() {
  const int tot = a + b;
  for (int i = 0; i < n; i++) {
    cin >> h[i];
    h[i] %= tot;
    if (h[i] == 0) h[i] += tot;
    h[i] = ceil((float)h[i] / a) - 1;
  }
  int res = 0;
  sort(h, h + n);
  for (int i = 0; i < n; i++) {
    if (h[i] <= k) {
      res++;
      k -= h[i];
    } else {
      break;
    }
  }
  cout << res << endl;
}
int main() {
  cin >> n >> a >> b >> k;
  solve();
  return 0;
}
