#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, a, b, k;
  cin >> n >> a >> b >> k;
  int ara[n];
  for (int i = 0; i < n; i++) {
    int t;
    cin >> t;
    int p = ceil((double)t / (double)(a + b)) - 1;
    t -= (p * (a + b) + a);
    ara[i] = t;
  }
  sort(ara, ara + n);
  int ans = 0;
  for (int i = 0; i < n; i++) {
    if (ara[i] <= 0)
      ans++;
    else {
      k -= (ceil((double)ara[i] / (double)a));
      if (k >= 0) ans++;
    }
  }
  cout << ans;
}
