#include <bits/stdc++.h>
using namespace std;
int solve() {
  int n, a, b, k;
  cin >> n >> a >> b >> k;
  int h[n];
  for (int i = 0; i < n; i++) {
    cin >> h[i];
    if (h[i] % (a + b) == 0) {
      h[i] = ceil((float)b / (float)a);
    } else {
      h[i] = h[i] % (a + b);
      h[i] = ceil((float)h[i] / (float)a) - 1;
    }
  }
  sort(h, h + n);
  int ans = 0;
  while (ans < n && k >= 0) {
    k = k - h[ans];
    if (k >= 0) {
      ans++;
    }
  }
  return ans;
}
int main() {
  int t = 1;
  while (t--) {
    cout << solve() << "\n";
  }
}
