#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, a, b, k, num;
  cin >> n >> a >> b >> k;
  vector<int> need;
  int cnt = 0;
  for (int i = 0; i < n; i++) {
    cin >> num;
    if (num <= a) {
      cnt++;
      continue;
    }
    if (num % (a + b) == 0) {
      int to_add = (a + b) / a;
      if ((a + b) % a != 0) to_add++;
      need.push_back(to_add - 1);
    } else {
      int temp = num / (a + b);
      int req = num - temp * (a + b);
      int to_add = req / a;
      if (req % a != 0) to_add++;
      need.push_back(to_add - 1);
    }
  }
  sort(need.begin(), need.end());
  for (int i = 0; i < need.size(); i++) {
    if (need[i] <= k) {
      k = k - need[i];
      cnt++;
    }
  }
  cout << cnt << endl;
  return 0;
}
