#include <bits/stdc++.h>
using namespace std;
const int N = 200002;
int n, a, b, k;
int h[N];
int main() {
  cin >> n >> a >> b >> k;
  for (int i = 0; i < n; i++) {
    cin >> h[i];
    h[i] %= (a + b);
    if (h[i] == 0) {
      h[i] = (a + b);
    }
    h[i] = (h[i] - 1) / a;
  }
  sort(h, h + n);
  int ans = 0;
  while (ans < n && k >= h[ans]) {
    k -= h[ans++];
  }
  cout << ans << endl;
  return 0;
}
